#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef __int128 lll;

inline lll rd() {
	lll x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

int main() {
	lll a = rd(), b = rd(), c = rd(), d = rd();
	auto split = [&](lll x) {
		vector<int> digits;
		do {
			digits.pb(x % 10);
			x = x / 10;
		} while (x);
		reverse(all(digits));
		return digits;
	};
	vector<int> A = split(a), B = split(b);
	int n = B.size();
	auto check = [&](int S) {
		vector<int> del;
		lll nb = 0;
		rep(i, 0, n - 1) {
			if ((S >> i) & 1) del.push_back(B[i]);
			else {
				if (nb == 0 && B[i] == 0) return false;
				nb = nb * 10 + B[i];
			}
		}
		// na * d = c * nb
		lll p = nb * c;
		if (p % d) return false;
		lll na = p / d;
		vector<int> nA = split(na), newdel;
		reverse(all(nA));
		for (auto x : A) {
			if (nA.empty() || x != nA.back()) newdel.pb(x);
			else nA.pop_back();
		}
		if (!nA.empty()) return false;
		if (del.size() != newdel.size()) return false;
		sort(all(del));
		sort(all(newdel));
		rep(i, 0, (int)del.size() - 1) if (del[i] != newdel[i]) return false;
		puts("possible");
		printf("%lld %lld\n", (ll)na, (ll)nb);
		return true;
	};
	rep(S, 0, (1 << n) - 2) if (check(S)) return 0;
	puts("impossible");
	return 0;
}