#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

typedef __int128 i128;
int n;
ll m;
i128 powx(i128 a,int b) {
	i128 r=1;
	for (;b;b>>=1) {
		if (b&1) r=r*a;
		a=a*a;
	}
	return r;
}

int main() {
	scanf("%d%lld",&n,&m);
	if (n>63) {
		puts("impossible");
		return 0;
	}
	for (int i=2;powx(i,n-1)<=m;i++) {
		for (int j=i-1;j>=1;j--) if (gcd(i,j)==1) {
			i128 v=(powx(i,n)-powx(j,n))/(i-j);
			if (m%v==0) {
				printf("%d %d\n",i-j,i);
				return 0;
			}
		}
	}
	puts("impossible");
}