#include <bits/stdc++.h>
using namespace std;

using ll=long long;
#define int ll
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define all(x) begin(x),end(x)
#define sz(x) (int)((x).size())
using pii=pair<int,int>;
using vi=vector<int>;
#define fi first
#define se second
#define pb push_back

typedef __int128 sll;

bool bad(sll a, sll b)
{
    return (log(double(a)) + log(double(b))) > 36*log(10);
}

sll bpow(sll a, sll b)
{
    sll res = 1;
    while (b>0)
    {
        if (b%2){
            if (bad(res, a))
                return -1;
            res*=a;
        }
        b/=2;
        if (bad(a, a))
            return -1;
        a*=a;
    }
    return res;
}

bool check(sll n, sll R, sll p, sll q)
{
    R *= (q-p);
    q = bpow(q, n);
    p = bpow(p, n);
    if (p==-1 || q==-1)
        return false;
    return R%(q-p)==0;
}

signed main() {
	cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int n, R;
    cin>>n>>R;
    for (int q=1; ; q++)
    {
        for (int p=q-1; p>0; p--)
            if (check(n, R, p, q))
            {
                cout<<q-p<<" "<<q<<"\n";
                exit(0);
            }
        if (clock()*1.0/CLOCKS_PER_SEC > 2.9)
            break;
    }
    cout<<"impossible\n";
}