/*
Original Python code:

N,K = list(map(int,input().split()))
A = list(map(int,input().split()))

MIN = min(A)
least = K%MIN
INF = 10**18
dp = [set() for _ in range(1<<N)]
dp[0].add(K)
for i in range(1<<N):
    if(not dp[i]):continue
    for j in range(N):
        if(i>>j & 1 == 1):continue
        next = i|(1<<j)
        for k in dp[i]:
            if(k%A[j] < least):continue
            dp[next].add(k%A[j])

print(max(dp[-1]))
*/

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    long long K;
    cin >> N >> K;
    vector<long long> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];

    long long MIN = *min_element(A.begin(), A.end());
    long long least = K % MIN;
    const long long INF = (long long)1e18;

    vector<unordered_set<long long>> dp(1 << N);
    dp[0].insert(K);

    for (int i = 0; i < (1 << N); i++) {
        if (dp[i].empty()) continue;
        for (int j = 0; j < N; j++) {
            if ((i >> j) & 1) continue;
            int nxt = i | (1 << j);
            for (long long k : dp[i]) {
                if (k % A[j] < least) continue;
                dp[nxt].insert(k % A[j]);
            }
        }
    }

    long long ans = -1;
    int full = (1 << N) - 1;
    for (long long x : dp[full]) {
        ans = max(ans, x);
    }
    cout << ans << "\n";
}