import math

def ok(n, m, p, q):
	if (n >= 60):
		return False
	calc = 0
	for i in range(0, n):
		calc = calc + (q ** i) * (p ** (n - i - 1))
	for i in range(1, n + 1):
		t = (q ** (n - i)) * (p ** (i - 1)) * m
		if (t % calc != 0):
			return False
	return True
n, m = map(int, input().split())
N = 2000

for q in range(2, N):
	for p in range(1, q):
		g = math.gcd(p,q)
		if g != 1:
			continue
		if(m % (q ** n - p ** n) ==0 and ok(n, m, p, q)):
			print(q - p, q)
			exit(0)
			
print("impossible")