#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 998244353
#define REP(i,n) for(long long i = 0;i < n;++i)    
#define seg_size 524288
int main(){
#define int long long
	long long a, b, c, d;
	cin >> a >> b >> c >> d;
	if (d == 10) {
		cout << "Impossible" << endl;
		return 0;
	}
	cout << "Possible" << endl;
	long long ans = 0;
	long long multiply = 1;
	long long required = 100;
	while (b != 0) {
		if (b >= 100) {
			ans += 50 * multiply * 100;
			b -= 100;
			multiply *= 2;
		}
		else {
			required = 100 - b;
			ans += 50 * multiply * b;
			break;
		}
	}
	if (required >= a) {
		ans += 100 * multiply * a;
	}
	else {
		ans += 100 * multiply * required;
		multiply *= 2;
		a -= required;
		while (a != 0) {
			if (a >= 100) {
				ans += 100 * multiply * 100;
				a -= 100;
				multiply *= 2;
			}
			else {
				required = 100 - a;
				ans += 100 * multiply * a;
				break;
			}
		}
	}
	cout << ans << endl;
	return 0;
}