#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
const ll INF = 4611686018427387903;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()

int n; int ans=0;
VI a(20);

void dfs(int p){
	bool f=1;
	REP(i,n){
		if(p<a[i])
			break;
		f=0;
		dfs(p%a[i]);
	}
	if(f)
		ans=max(ans,p);
}

int main(){
	int k; cin >> n >> k;
	REP(i,n) cin >> a[i];
	sort(a.begin(),a.begin()+n);
	dfs(k);
	cout << ans << endl;
	return 0;
}