#include <iostream>
#include <iomanip>
#include <vector>
#include <utility>
#include <map>
#include <algorithm>
#include <queue>
#include <cmath>
#include <numeric>
#include <set>

using namespace std;
struct aaa{aaa(){cin.tie(nullptr); ios::sync_with_stdio(false); cout<<fixed<<setprecision(20);};}aaa;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
#define debug(v) {cerr<<"\033[1;36m[debug]\033[m "<<#v<<" : "<<v<<endl;}

using int64 = long long;

void dfs(const int& i, const int& n, int k, const vector<int>& a, vector<bool>& used, int& ans) {
    if (ans >= k) return;
    if (i >= n) {
        ans = max(ans, k);
        return;
    }

    for (int j=0; j<n; j++) {
        if (used[j]) continue;
        if (ans >= k%a[j]) continue;
        used[j] = true;
        dfs(i+1, n, k % a[j], a, used, ans);
        used[j] = false;
    }
}

int main() {

    int n,k;
    cin >> n >> k;
    vector a(n,0);
    for (int i=0; i<n; i++) cin >> a[i];

    int ans = 0;
    vector<bool> used(n,false);
    dfs(0,n,k,a,used,ans);

    cout << ans << endl;
}