#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main() {
	int n, m;
	cin >> n >> m;
	bool pos = false;
	if (n >= 4) pos = true;
	if (n == 3){
		if (m <= 7) pos = true;
	}
	if (n == 2){
		if (m >= 1 && m <= 3) pos = true;
	}
	if (n == 1 && m == 1) pos = true;
	cout << (pos ? "Possible" : "Impossible") << endl;
    return 0;
}