#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

int N;
ll K;
vector<ll> A;

ll ans;

void solve(int now,ll val){
  if(now==N){
    chmax(ans,val);
    return;
  }
  for(int i=now;i<N;i++) solve(i+1,val%A[i]);
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin>>N>>K;
  A.resize(N);
  rep(i,N) cin>>A[i];

  sort(all(A));
  reverse(all(A));

  solve(0,K);
  cout<<ans<<endl;

  return 0;
}