#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;

typedef long long ll;

int main() {
    int N, K, X = 0;
    cin >> N >> K;
    vector<int> A(N);
    rep(i, N) cin >> A[i];
    sort(A.begin(), A.end());
    rep(i, 1 << N) {
        if (i == 0) continue;
        int L = K;
        rep(j, N) {
            if ((i >> j) & 1) continue;
            L %= A[N - 1 - j];
        }
        L %= A[0];
        X = max(X, L);
    }
    cout << X << "\n";
}