/*
ID: wuhaozh1
PROB: humble
LANG: C++
*/
#include <cstdio>
#include <algorithm>
using namespace std;
const int inf=2147483647;
int prime[105];
int humble[100005];int idx=0;
int x[105];
int main() {
	freopen("humble.in","r",stdin);
	freopen("humble.out","w",stdout);
	int k,n;
	scanf("%d%d",&k,&n);
	for(int i=0;i<k;++i) {
		scanf("%d",&prime[i]);
	}
	humble[idx++]=1;
	while(idx<=n) {
		int mn=inf;
		for(int i=0;i<k;++i) {
			while(prime[i]*humble[x[i]]<=humble[idx-1]) {
				x[i]++;
			}
			mn=min(mn,prime[i]*humble[x[i]]);
		}
		humble[idx++]=mn;
	}
	printf("%d\n",humble[n]);
	fclose(stdin);
	fclose(stdout);
	return 0;
}