#include using namespace std; #define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i) #define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i) #define REP(i, n) rep(i, 0, n) #define REP2(i, n) rep2(i, 0, n) #define all(hoge) (hoge).begin(), (hoge).end() #define en '\n' using ll = long long; using ull = unsigned long long; template using vec = vector; template using vvec = vector>; typedef pair P; constexpr long long INF = 1LL << 60; constexpr int INF_INT = 1 << 25; constexpr long long MOD = (ll)1e9 + 7; // constexpr long long MOD = 998244353LL; using ld = long double; static const ld pi = 3.141592653589793L; typedef vector Array; typedef vector Matrix; template inline bool chmin(T &a, T b) { if(a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if(a < b) { a = b; return true; } return false; } struct Edge { ll to, rev; long double cap; Edge(ll _to, long double _cap, ll _rev) { to = _to; cap = _cap; rev = _rev; } }; using Edges = vector; using Graph = vector; void add_edge(Graph &G, ll from, ll to, long double cap, bool revFlag, long double revCap) { G[from].push_back(Edge(to, cap, (ll)G[to].size())); if(revFlag) G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1)); } void solve() { ll n, k; cin >> n >> k; vec a(n); REP(i, n) cin >> a[i]; sort(all(a), greater()); ll all = 1LL << (n - 1); ll ans = 0; REP(bit, all) { ll x = k; REP(i, n - 1) { if((bit >> i) & 1LL) { x %= a[i]; } } x %= a[n - 1]; chmax(ans, x); } cout << ans << en; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(); // ll t;cin>>t;REP(i,t) solve(); return 0; }