#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 22

int n, k;
int a[MAX_N];

int dfs(int x, int y){
    if(x == n)return y;
    int res = 0;

    srep(i,x,n){
        res = max(res, dfs(i+1,y%a[i]));
    }

    return res;
}

int main() {
    cin >> n >> k;
    rep(i,n)cin >> a[i];
    sort(a,a+n,greater<int>());

    int ans = dfs(0, k);
    
    cout << ans << endl;
    return 0;
}