#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}


signed main(void) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    if(d >= 10){
        cout << "Impossible" << endl;
    }else{
        cout << "Possible" << endl;
        int ans = 0;
        int t = 1;
        while(b + a){
            if(b){
                if(b >= 100){
                    ans += 50*t*100;
                    b -= 100;
                }else{
                    ans += 50*t*b;
                    ans += 100*t*max(0LL,min(100-b,a));
                    a -= min(100-b,a);
                    b = 0;
                }
            }else{
                if(a >= 100){
                    ans += 100*t*100;
                    a -= 100;
                }else{
                    ans += 100*t*a;
                    a = 0;
                }
            }
            //cout << a << " " << b << " " << ans << endl;
            t *= 2;
        }
        cout << ans << endl;
    }

}