#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;

using LL=long long;


const LL INFLL=LL(2e18);

int n;
LL m;
LL pwn[2005];

LL ad(LL x,LL y){
	return x+y<INFLL?x+y:INFLL;
}

LL mu(LL x,LL y){
	return x<=INFLL/y?x*y:INFLL;
}

LL po(LL x,LL y){
	LL z=1;
	while(y){
		if(y&1)z=mu(z,x);
		if((y>>=1))x=mu(x,x);
	}
	return z;
}

int main(){
	cin>>n>>m;
	rep(i,1,2000){
		pwn[i]=po(i,n);
		assert(pwn[i]>=0);
		assert(pwn[i]>=pwn[i-1]);
	}
	rep(q,2,2000)if(pwn[q]<INFLL){
		rep(p,1,q-1)if(__gcd(p,q)==1){
			LL fm=pwn[q]-pwn[q-p];
			LL fz=p*(pwn[q]/q);
			
			LL g=__gcd(fz,fm);
			/*if(g!=1){
				printf("%d %d\n",p,q);
			}*/
			// assert(g==1);
			
			fz/=g,fm/=g;
			if(m%fm==0){
				printf("%d %d\n",p,q);
				exit(0);
			}
		}
	}
	puts("impossible");
	return 0;
}