#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int dfs(vector<int> &a, int index, vector<bool> &chk, list<int> &list, int k){
  bool f = false;
  for(int i = index-1; i >= 0; i--){
    if(chk.at(i) == false){
      f = true;
      break;
    }
  }
  if(f == false){
    if(list.size() == 0) return -1;
    for(int i : list){
      k %= i;
    }
    return k;
  }
  int ret = -1;
  rep(i, index){
    list.push_back(a.at(i));
    chk.at(i) = true;
    int t = dfs(a, i, chk, list, k);
    ret = max(ret, t);
    chk.at(i) = false;
    list.pop_back();
  }
  return ret;
}

int main(){
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  rep(snip_i, n) cin >> a.at(snip_i);
  sort(ALL(a));
  vector<bool> chk(n, false);
  list<int> list;
  int ans = dfs(a, n, chk, list, k);
  cout << ans << endl;
  return 0;
}