#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n, k;
    cin >> n >> k;
    vector<int> v(n);
    for (auto &&i : v) scanf("%d", &i);
    sort(v.begin(),v.end(), greater<>());
    int ans = 0;
    for (int S = (1 << (n-1)); S < (1 << n); ++S) {
        int val = k;
        for (int i = 0; i < n; ++i) {
            if(S & (1 << i)) val %= v[i];
        }
        ans = max(ans, val);
    }
    cout << ans << "\n";
    return 0;
}