/*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}

void solve(){
    ll N,K;
    cin >> N >> K;
    ll A[22];
    rep(i,0,N) cin >> A[i];
    ll ans = 0;
    rep(bit,0,(1LL<<N)){
        vector<ll> v,v2;
        ll min_val = INF;
        rep(i,0,N){
            if((bit>>i)&1){
                v.push_back(A[i]);
                min_val = max(min_val, A[i]);
            }else{
                v2.push_back(A[i]);
            }
        }
        sort(v.begin(), v.end(), greater<ll>());
        sort(v2.begin(), v2.end());
        ll X = K;
        for(auto &e: v) X %= e;
        for(auto &e: v2) X %= e;
        ans = max(ans, X);
        // bool ok = true;
        // rep(i,0,N){
        //     if(!((bit>>i)&1)){
        //         if(A[i] < min_val){
        //             ok = false;
        //         }
        //     }
        // }
        // if(not ok) continue;
        // sort(v.begin(), v.end());
        // ll X = K;
        // for(auto &e: v) X %= e;
        // ans = max(ans, X);
    }
    print(ans);
        // vector<ll> v;
        // rep(i,0,N) v.push_back(A[i]);
        // sort(v.begin(), v.end());
        // do {
        //     ll X = K;
        //     rep(i,0,N) X %= v[i];
        //     if(X == 9){
        //         printa(v, N);
        //         break;
        //     }

        // }while(next_permutation(v.begin(), v.end()));

        // }
        // print(ans);

    

}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}