#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;
 
const int inf = (int)1e9; 
 
ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

int rate[10]={1,2,4,8,16,32,64,128,256,512};

int main(void){
	int A,B,C,D;
	cin>>A>>B>>C>>D;
	if(D==10){
		cout<<"Impossible"<<endl;
		return 0;
	}
	int ans = 0;
	int cnt = 0;
	for(int i=1;i<=B;i++){
		cnt++;
		int r = (cnt-1)/100;
		ans+=50*rate[r];
	}
	for(int i=1;i<=A;i++){
		cnt++;
		int r = (cnt-1)/100;
		ans+=100*rate[r];
	}
	cout<<"Possible"<<endl;
	cout<<ans<<endl;
	return 0;
}