#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

int N;
int A[21];
int dp[1<<21];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    ll K;
    cin >> N >> K;
    for(int i = 0; i < N; i++) cin >> A[i];
    sort(A, A+N, greater<int>());
    int ans = 0;
    for(int i = 1; i < (1<<N); i += 2){
        int tmp = K;
        for(int j = N-1; j >= 0; j--){
            int m = 1<<j;
            if(!(m&i)) continue;
            tmp %= A[N-j-1];
        }
        ans = max(ans, tmp);
    }
    cout << ans << endl;
}