#define alphanso                  \
	ios_base::sync_with_stdio(0); \
	cin.tie(NULL)
#include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
int main()
{
	alphanso;
	int n, k, i, gcd = 0, x, mx = INT_MIN;
	cin >> n >> k;
	for (i = 1; i <= n; i++)
	{
		cin >> x;
		gcd = __gcd(gcd, x);
		mx = max(mx, x);
	}
	if (mx < k)
		cout << "IMPOSSIBLE";
	else
		!(k % gcd) ? cout << "POSSIBLE" : cout << "IMPOSSIBLE";
	return 0;
}
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <string.h>
#define s(n)                        scanf("%d",&n)
#define sc(n)                       scanf("%c",&n)
#define sl(n)                       scanf("%I64d",&n)
#define sf(n)                       scanf("%lf",&n)
#define ss(n)                       scanf("%s",n)
#define INF                         (int)1e9
#define EPS                         1e-9
#define bitcount                    __builtin_popcount
#define gcd                         __gcd
#define forall(i,a,b)               for(int i=a;i<b;i++)
#define foreach(v, c)               for( typeof( (c).begin()) v = (c).begin();  v != (c).end(); ++v)
#define all(a)                      a.begin(), a.end()
#define in(a,b)                     ( (b).find(a) != (b).end())
#define pb                          push_back
#define fill(a,v)                    memset(a, v, sizeof a)
#define sz(a)                       ((int)(a.size()))
#define mp                          make_pair
#define MOD                         1000000007
typedef long long ll;
/*For you see , each day i love you
 more.Today more than yesterday
  less than tomorrow.*/
using namespace std;

int main()
{
	int n,m;cin>>n>>m;
	int maxi = 0;
	
	for(int i = 1;i*i<=m;i++)
	{
		if(m%i) continue;
		
		int b = m/i;
		
		if(b >= n) maxi = max(maxi , i);
		
		if(i >= n) maxi = max(maxi , b);	
	}
	
	
	cout<<maxi<<endl;
	
	return 0;
}