#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define fir first
#define sec second
template<typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template<typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
typedef long long ll;

ll mul(ll x,ll y) {
    ll t=5e18/x;
    if (y>t) return 2e18;
    return min(ll(2e18),x*y);
}
ll add(ll x,ll y) {
    ll t=5e18-x;
    if (y>t) return 2e18;
    return min(ll(2e18),x+y);
}

int main() {
    file();
    ios::sync_with_stdio(false),cin.tie(0);
    int n; ll m;
    cin>>n>>m;
    if (n>61) return cout<<"impossible\n",0;
    rep(b,2,4000) rep(a,1,b-1) {
        ll t=0;
        static ll pwa[233],pwb[233];
        pwa[0]=pwb[0]=1;
        rep(i,1,n) pwa[i]=mul(pwa[i-1],a),pwb[i]=mul(pwb[i-1],b);
        rep(i,0,n-1) t=add(t,mul(pwa[i],pwb[n-1-i]));
        if (m%t==0) return cout<<b-a<<' '<<b<<'\n',0;
    }
    return cout<<"impossible\n",0;
}