#include <bits/stdc++.h>
#include <math.h>

#include <algorithm>
#include <array>
#include <atcoder/all>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <vector>

using namespace std;
using namespace atcoder;

using Graph = vector<vector<int>>;

using ll = long long;
typedef pair<ll, ll> P_ll;
typedef pair<int, int> P;

const ll INF_ll = 1e17;
const int INF = 1e8;
template <class T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;

int main() {
  ll N, K;
  cin >> N >> K;
  vector<ll> A(N);
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }
  vector<vector<ll>> dp(1 << N, vector<ll>(N, 0));
  for (int i = 0; i < N; i++) {
    dp[1 << i][i] = K % A[i];
  }
  for (int i = 0; i < 1 << N; i++) {
    for (int j = 0; j < N; j++) {
      if (((i >> j) & 1) == 0) {
        continue;
      }
      for (int k = 0; k < N; k++) {
        if (((i >> k) & 1) == 1) {
          continue;
        }
        int ni = i | (1 << k);
        chmax(dp[ni][k], dp[i][j] % A[k]);
      }
    }
  }
  ll ans = 0;
  for (int i = 0; i < N; i++) {
    chmax(ans, dp[(1 << N) - 1][i]);
  }
  cout << ans << endl;

  return 0;
}