#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <deque>
#include <iomanip>
#include <cstdio>

using namespace std;
typedef  long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define  MP make_pair
#define  PB push_back
#define inf  1000000007
#define rep(i,n) for(int i=0;i<(int)(n);++i)


int main(){
    ll a,b,cc,d;
    cin >> a >> b >> cc >> d;
    ll p = 100;
    ll g = 50;
    if(d==10){
        cout << "Impossible" << endl;
        return 0;
    }
    cout << "Possible" << endl;
    ll c = 0;
    ll t = 1;
    ll s = 0;
    for(int i=0;i<b;i++){
        c++;
        if(c%100==1&&c!=1)t*=2;
        s += t*g;
    }
    for(int i=0;i<a;i++){
        c++;
        if(c%100==1&&c!=1)t*=2;
        s += t*p;
    }
    cout << s << endl;
    return 0;
}