#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stdio.h>
#include <string.h>
#include <cstdlib>
#include <math.h>
#include <bitset>
#include <iterator>	
#include <iomanip>
#include <sstream>
#include <numeric>
#include <cassert>
#define INF 2000000000000000
#define MOD 1000000007
#define sym cout<<"---------"<<endl;
#define ll long long
#define mk make_pair
#define en endl
#define RE return 0
#define int ll
#define P pair<int,int>
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int gcd(int a,int b){if(a%b==0){return b;}else return gcd(b,a%b);}
int lcm(int a,int b){if(a==0){return b;} return a/gcd(a,b)*b;}

signed main(){
	int a,b,c,d; cin>>a>>b>>c>>d;
	if(d*100>=1000){
		cout<<"Impossible"<<en;
		RE;
	}
	
	int ans=0;
	int times=1;
	for(int i=1; i<=4; i++){
		if(b>=i*100){ 
			ans+=50*times*100;
			times*=2;
		}else{
			int l=b-100*(i-1);
			ans+=50*times*l;
			if(a>=(100-l)){ 
				ans+=times*100*(100-l);
				a-=100-l;
			}
			else ans+=times*100*a;
			times*=2;
			break;
		}
	}
	
	int aa=0;
	for(int i=1; i<=4; i++){
		aa=ans;
		if(a>=i*100){ 
			ans+=100*times*100;
			times*=2;
		}else{
			ans+=100*times*(a-100*(i-1));
			break;
		}
	}
	cout<<"Possible"<<endl<<ans<<en;
}