import math

def ok(n, m, p, q):
	if (n > 60):
		return False
	return m % ((p ** n - q ** n) // (p - q)) == 0
n, m = map(int, input().split())
N = 2000
if n > 60:
	print("impossible")
	exit(0)
	
for q in range(2, N):
	for p in range(q - 1, 0, -1):
		g = math.gcd(p,q)
		if g != 1:
			continue
		if (q ** n - p ** n > m * (q - p)):
			break
		if(ok(n, m, p, q)):
			print(q - p, q)
			exit(0)
			
print("impossible")