#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, int> PL;
constexpr int mod =  1e9 + 7;
constexpr int INF = 2e9;
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  rep(i,n) cin >> a[i];
  
  vector<vector<int>> dp(1 << n, vector<int>(n, 0));
  for (int i = 0; i < n; i++) dp[0][i] = k;

  for (int bit = 0; bit < (1 << n); bit++) {

    for (int i = 0; i < n; i++) {
      if (bit == 0) {
        dp[bit | (1 << i)][i] = dp[0][i] % a[i];
        continue;
      }
      if (bit & (1 << i)) continue;
      for (int j = 0; j < n; j++) {
        if (!(bit & (1 << j))) continue;
        dp[bit | (1 << i)][i] = max(dp[bit | (1 << i)][i], dp[bit][j] % a[i]);
      }
    }
  }
  int res = 0;
  for (int i = 0; i < n; i++) res = max(res, dp[(1 << n) - 1][i]);
  cout << res << endl;
  return 0;
}