#include<bits/stdc++.h>
using namespace std;
int n,m,x; 
int minn=1e5;
bool f=0;
int main(){
	cin >> n >> m;
	for(int i=0; i<n; i++){
		cin >> x;
		if(m%x==0){
			if(m/x<minn){
				minn=m/x;
				f=1;
			}
		}
	}
	if(f==0) cout << "-1";
	else cout << minn;
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int n,m,x; 
int minn=1e5;
bool f=0;
int main(){
	cin >> n >> m;
	for(int i=0; i<n; i++){
		cin >> x;
		if(m%x==0){
			if(m/x<minn){
				minn=m/x;
				f=1;
			}
		}
	}
	if(f==0) cout << "-1";
	else cout << minn;
	return 0;
}

#include<bits/stdc++.h>
#include<queue>
#include<set>
#include<stack>
#include<cstring>
#define ll long long
using namespace std;
const int N=1e5+10;
const int M=2023;
const int inf=0x3f3f3f3f;
ll ans=inf,n,a[N],m;
int main()
{
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&a[i]);
	}
	for(int i=1;i<=n;i++)
	{
		if(m%a[i]==0)
		{
			ans=min(ans,m/a[i]);
		}
	}
	(ans!=inf) ? printf("%lld",ans) : printf("-1");
}