CF797A.k-Factorization

Given a positive integer n, find k integers (not necessary distinct) such that all these integers are strictly greater than 1, and their product is equal to n.

给定一个正整数 $n$，找出 $k$ 个整数（这些整数不必互不相同），使得所有这些整数均严格大于 $1$，且它们的乘积等于 $n$。

The first line contains two integers n and k (2 ≤ n ≤ 100000, 1 ≤ k ≤ 20).

第一行包含两个整数 $n$ 和 $k$（$2 \leq n \leq 100000$，$1 \leq k \leq 20$）。

If it's impossible to find the representation of n as a product of k numbers, print -1.

Otherwise, print k integers in any order. Their product must be equal to n. If there are multiple answers, print any of them.

如果无法将 $n$ 表示为 $k$ 个数的乘积，则输出 -1。

否则，以任意顺序输出 $k$ 个整数。它们的乘积必须等于 $n$。若存在多个答案，输出其中任意一个即可。