#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define fore(i,a) for(auto &i:a)

typedef pair <int, int> P;
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
const int  INF = 2147483647;
const ll INFL = 9223372036854775807;
const ll mod = 1000000007;



int main() {
	
	int a, b, c, d;
	cin >> a >> b >> c >> d;
	if (d >= 10) {
		cout << "Impossible" << endl;
		return 0;
	}
	cout << "Possible" << endl;


	ll ans = 0;

	int n = 1;
	while (true) {
		if (b > 100) {
			b -= 100;
			ans += 5000 * n;
			n *= 2;
		}
		else if (a + b >= 100) {
			int k = 100 - b;
			ans += 100 * k*n + 50 * b*n;
			b = 0;
			a -= k;
			n *= 2;
		}
		else {
			ans += 100 * a*n + 50 * b*n;
			break;
		}
	}

	cout << ans << endl;
	
	return 0;

}