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

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt")

using ll = long long int;
using ull = unsigned long long int;
using vi = vector<ll>;
using ii = pair<ll,ll>;
using vii = vector<ii>;
using ld = long double;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T>
using ordered_set = tree < T, null_type, less<T>,
rb_tree_tag,
tree_order_statistics_node_update >;

#ifdef SA_DEBUG
template <class T>
void print(T a) {cerr << a << endl;}
template <class T, class... V> 
void print(T a, V... b) {cerr << a << ", "; print(b...);}
#define dbg(...) cerr << "[" << __LINE__ << "] " << #__VA_ARGS__ << " :: ", print(__VA_ARGS__)
#else
#define dbg(...) 7
#endif

#define eb emplace_back
#define fi first
#define se second

const ll INFL = 2e18;
const int INF = 1e9;
const double PI = acos(-1);
const ll mod = 1e9+7;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template<class T, class V> 
ostream& operator << (ostream &s, pair<T, V> a){
	s << a.fi << ' ' << a.se; return s;
}

template<class T, class V> 
istream& operator >> (istream &s, pair<T, V> &a){
	s >> a.fi >> a.se; return s;
}

template<class T> 
ostream& operator << (ostream &s, vector<T> a){
	for(int i = 0; i < (int)a.size(); i++){
		if(i > 0)s << ' ' ; 
		s << a[i];
	} return s;
}

template<class T> 
istream& operator >> (istream &s, vector<T> &a){
	for(T &x : a)s >> x; 
	return s;
}

template<class T> 
void input(T a[], int l, int r, istream &s = cin){
	while(l <= r)s >> a[l++];
}

template<class T> 
void output(T a[], int l, int r, bool en = true, ostream &s = cout){
	while(l <= r){ s << a[l++];
		if(l <= r) s << ' ';
	} if(en)s << "\n";
}



const int N = 1e6+3, K = 26;
//====================================================================//

ll pw(__int128 a, __int128 b){
	if(b > 60)return INFL;
	__int128 ans = 1;
	while(b){
		if(a > INFL)return INFL;
		if(b & 1){
			ans = ans * a;
			if(ans > INFL)return INFL;
		}
		a = a * a;
		b >>= 1;
	}
	return ans;
}
//bool ok(ll n, ll m, ll p, ll q){
	//ll calc = 0;
	//for(int i = 0; i < n; i++){
		//calc = calc + pw(q, i) * pw(p, n - i - 1);
	//}
	//for(int i = 1; i <= n; i++){
		//ll t = pw(q, n - i) * pw(p, i - 1) * m;
		//if(t % calc)return false;
	//}
	//return true;
//}
void testcase(){
	ll n, m;
	cin >> n >> m;
	for(int i = 2; pw(i, n) - 1 <= m; i++){
		if(m % (pw(i, n) - 1) == 0){
			cout << i - 1 << ' ' << i << "\n";
			return;
		}
	}
	cout << "impossible\n";
}





int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	int T = 1;
	//cin >> T;
	
	for(int qq = 1; qq <= T; ++qq){
		//cout << "Case #" << qq << ": ";
		testcase();
	}
	return 0;
}
/*
100 3 1
S 1 4 2
S 2 3 5
M 3 4 6
6 51
*/