#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

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

    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());

    int r = 0;
    for (int x = 0; x < 1 << (n - 1); x++) {
        int t = k;
        for (int i = 0; i < n - 1; i++) {
            if (x >> i & 1) {
                t %= a[i];
            }
        }
        r = max(r, t % a.back());
    }

    cout << r << endl;

    return 0;
}