#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
#include<iomanip>
#include<queue>
using namespace std;
typedef long long int lont;
int jou(int x) {
	int y=1;
	for (int ia = 0; ia < x; ia++) {
		y *= 2;
	}
	return y;
}
int main() {
	int A, B, C, D;
	cin >> A >> B >> C >> D;
	if (D >= 10) {
		cout << "Impossible" << endl;
	}
	else {
		int ans = 0;
		int cnt = 0;
		while (B > 0) {
			B--;
			ans += 50 * jou(cnt/100);
			cnt++;
		}
		while (A > 0) {
			A--;
			ans += 100 * jou(cnt / 100);
			cnt++;
		}
		cout << "Possible" << endl << ans << endl;
	}
}