import math
def is_prime(number):
    for i in range(2,int(math.sqrt(number))+1):
        if number%i == 0:
            return False
    return True
n,k = map(int, input().split())
counter = 0
ans = []
sqrt_n = int(math.sqrt(n))
if k <= n:
    if is_prime(k):
        while n % k == 0:
            n //= k
            counter +=1
        if counter % 2 == 1:
            print(-1)
            exit()
        else:
            stepen = k**2
            for i in range(counter//2):
                ans.append(stepen)
for i in range(2, sqrt_n+1):
        if n % i == 0:
            if i != k:
                while n % i == 0:
                    n //= i
                    ans.append(i)
                if n == 1:
                    break
if n != 1:
    ans.append(n)
ans.sort()
print(*ans)