#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

#define pb push_back

const ld pi = 3.14159265358979323846;
const int mod = (int)1e9 + 7;
const ll INF = 1e18;

template<typename T>
T chmax(T a, T b) {
    return a > b ? a : b;
}

template<typename T>
T chmin(T a, T b) {
    return a > b ? b : a;
}

const int N = (int)2e5 + 1, M = N * 2;

using i128 = __int128;

ostream &operator<<(std::ostream &os, i128 n) {
    std::string s;
    while (n) {
        s += '0' + n % 10;
        n /= 10;
    }
    std::reverse(s.begin(), s.end());
    return os << s;
}
 
void solve(){  
    ll a, b, c, d;
    cin >> a >> b >> c >> d;

    ll gcd = __gcd(c, d);
    c /= gcd;
    d /= gcd;
  
    map<i128, map<string, int>> mp1, mp2;
    auto get = [&](ll a) -> pair<vector<ll>, vector<string>>{
        vector<ll> A;
        vector<string> T;
        string s = to_string(a);
        int n = s.size();

        for(int i = 0; i < 1 << n; i++){
            ll qwq = 0;
            for(int j = 0; j < n; j++){
                if(i >> j & 1){
                    qwq = qwq * 10 + (s[j] - '0');
                }
            }
            if(qwq == 0){
                continue;
            }
            A.pb(qwq);

            string cur = to_string(qwq), miss = "";
            int l = 0, r = 0;
            for(; l < n && r < cur.size() && l < s.size(); ){
                if(s[l] == cur[r]){
                    l++;
                    r++;
                }
                else{
                    miss += s[l];
                    l++;
                }
            }

            for(int i = l; i < s.size(); i++){
                miss += s[i];
            }
            sort(miss.begin(), miss.end());
            T.pb(miss);
        } 
        return {A, T};
    };

    auto p1 = get(a), p2 = get(b);

    for(int i = 0; i < p1.first.size(); i++){
        mp1[p1.first[i]][p1.second[i]] = 1;

    }
    for(int i = 0; i < p2.first.size(); i++){
        mp2[p2.first[i]][p2.second[i]] = 1;
    }

    for(int i = 0; i < p1.first.size(); i++){
        i128 p = p1.first[i];
        if(p * d % c == 0){
            p = p * d / c;
            i128 q = p;
 
            if(mp2[q][p1.second[i]]){
                cout << "possible" << endl;
                cout << p1.first[i] << " " << q << endl;
                return;
            }
        }
    }

    for(int i = 0; i < p2.first.size(); i++){
        i128 p = p2.first[i];
        if(p * c % d == 0){
            p = p * c / d;
            
            i128 q = p;

            if(mp1[q][p2.second[i]]){
                cout << "possible" << endl;
                cout << p2.first[i] << " " << q << endl;
                return;
            }
        }
    }
    cout << "impossible" << endl;
} 

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
    // cin >> t;

    while(t--){
        solve();
    }

    return 0;
}