#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using pii = pair <int, int>;
const ll mod = 998244353;
//~ const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 20;
int a[N];

int main() {
	ios :: sync_with_stdio(false);
	
	int n, k; cin >> n >> k;
	for(int i = 0; i < n; i ++)
		cin >> a[i];
	
	sort(a, a + n);
	reverse(a, a + n);
	
	int m = n - 1;
	int ans = 0;
	for(int mask = 0; mask < (1 << m); mask ++) {
		int t = k;
		for(int i = 0; i < m; i ++)
			if((mask >> i) & 1)
				t = t % a[i];
		t = t % a[m];
		ans = max(ans, t);
	}
	
	cout << ans << '\n';
}