A. k-Factorizationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGiven 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.InputThe first line contains two integers n and k (2 ≤ n ≤ 100000, 1 ≤ k ≤ 20).OutputIf 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.ExamplesInput100000 2Output2 50000 Input100000 20Output-1Input1024 5Output2 64 2 2 2 
Input100000 2
Output2 50000 
['implementation', 'math', 'number theory', '*1100']