#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
typedef vector<vector<ll> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;

ll n,k;
vector<ll>a;

int main(){
    cin >> n >> k;
    a.resize(n);
    rep(i,n)cin>>a[i];
    sort(a.rbegin(),a.rend());
    ll ans = 0;
    for(int bit=1;bit<(1<<n);bit++){
        ll now = k;
        rep(i,n){
            if((bit>>i)&1){
                now %= a[i];
            }
        }
        now %= a[n-1];
        chmax(ans,now);
    }
    cout << ans << endl;
    return 0;
}