#include<bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
using u64 = unsigned long long;
using u32 = unsigned;
using u128 = __uint128_t;
using i128 = __int128_t;
std::vector<int> ps;
const int M = 1e6;

u64 pms[M];
int cc;

ll n;

bool ins(u64 x) {
	for(int i = 0;i < cc;++i) {
		if((i128) pms[i] * x <= n) {
			if(cc == M) {
				return 0;
			}
			pms[cc++] = pms[i] * x;
		}
	}
	return 1;
}
int idx;

ll check(ll n) {
	for(int i : ps) {
		for(;(u64)n % (u32)i == 0;) n /= i;
	}
	return n == 1;
}
ll ans = 1;
void dfs(ll x, int id) {
	if(id < idx) {
		ll z = std::upper_bound(pms, pms + cc, n / x)[-1];
		ans = std::max(ans, z * x);
		return ;
	}
	for(;;) {
		dfs(x, id - 1);
		if((i128)x * ps[id] > n) {
			break;
		}
		x *= ps[id];
	}
}
void guess(ll n) {
	for(int i = 0;i < 2e5 && !check(n);--n, ++i);
	if(check(n)) {
		cout << n << '\n';
		exit(0);
	}
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	int k; cin >> k >> n;
	ps.resize(k);
	for(int & x : ps) cin >> x;
	guess(n);
	*pms = 1, cc = 1;
	sort(ps.begin(), ps.end());
	for(idx = 0;idx < (int) ps.size();++idx) {
		if(!ins(ps[idx])) break;
	}
	std::sort(pms, pms + cc);
	dfs(1, ps.size() - 1);
	cout << ans << '\n';
}