import math

n, m = map(int, input().split())

max_pow = int(pow(1e19, 1.0 / n))
pw = []
pw.append(1)
for i in range(1, max_pow + 1):
    pw.append(pow(i, n))

for q in range(1, max_pow + 1):
    for p in range(1, max_pow + 1):
        if p < q and math.gcd(p, q) == 1:
            if m % (pw[q] - pw[q - p]) == 0:
                print(p, end=' ')
                print(q)
                exit(0)
print("impossible")