#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <tuple>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <ranges>
using namespace std;
using ll = long long;

auto range(int n) { return views::iota(0, n); }

template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cout << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

int solve() {
  int n, k; cin >> n >> k;
  vector<int> vs(n);
  for (int i : range(n)) cin >> vs[i];
  sort(vs.begin(), vs.end());
  int ret = 0;
  for (int bit : range(1 << n)) {
    int now = k;
    for (int i = n - 1; i >= 0; --i) if ((bit >> i) & 1) {
      now %= vs[i];
    }
    now %= vs[0];
    ret = max(ret, now);
  }
  return ret;
}

int main() {
  cout << solve() << endl;
}