#include<iostream>
#include<iomanip>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<tuple>
#include<complex>
#define REP(i, N) for(ll i = 0; i < N; ++i)
#define FOR(i, a, b) for(ll i = a; i < b; ++i)
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define INF (long long)1000000000
#define MOD 1000000007
#define EPS (long double) 1e-8
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
int dh[4] = {1, 0, -1, 0};
int dw[4] = {0, 1, 0, -1};

using namespace std;

int main() {
	int n, m;
	cin>>n>>m;
	if(n == 1) {
		if(m == 0) cout<<"Impossible"<<endl;
		else cout<<"Possible"<<endl;
	}
	else if(n == 2) {
		if(m == 0) cout<<"Impossible"<<endl;
		else cout<<"Possible"<<endl;
	}
	else if(n == 3) {
		cout<<"Possible"<<endl;
	}
	else if(n == 4) {
		cout<<"Possible"<<endl;
	}
	else cout<<"Possible"<<endl;
}