/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.06.19 21:45:56
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

int main() {
    int n, k;
    cin >> n >> k;
    vector< int > a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    sort(a.rbegin(), a.rend());
    vector< int > dp(1 << n);
    dp[0] = k;
    int ans = 0;
    for (int i = 1; i < 1 << n; i++) {
        for (int j = 0; j < n; j++) {
            if (i & (1 << j)) {
                dp[i] = dp[i & (i - 1)] % a[n-1-j];
                break;
            }
        }
    }
    for (int i = 1; i < n; i++) {
        int p = 1 << i;
        ans = max(ans, dp[p - 1]);
    }
    cout << ans << endl;
    return 0;
}