#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <random>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int a, b, c, d;
	int s=0;
	cin>>a>>b>>c>>d;
	if(d>=10){
		cout<<"Impossible"<<endl;
		return 0;
	}
	cout<<"Possible"<<endl;
	int ct=0;
	for(int i=0; i<b; i++){
		s+=(1<<(ct/100))*50;
		ct++;
	}
	for(int i=0; i<a; i++){
		s+=(1<<(ct/100))*100;
		ct++;
	}
	cout<<s<<endl;
	return 0;
}