Codeforces 797A k-Factorization

A. k-Factorization

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

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

Output

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.

Examples

input

100000 2

output

2 50000 

input

100000 20

output

-1

input

1024 5

output

2 64 2 2 2 

虽然这道题很水，但是我不会写.....

题目大意：给你一个n，分解为k个数，这k个数可以相同，相乘要等于n

根据唯一分解定理，将n分解为质因数的形式

#include<iostream>
#include<vector>
using namespace std;
vector<int> vec;
void fun(int n){
	for(int i=2;i*i<=n;i++){
		while(n%i==0){
			vec.push_back(i);
			n/=i;
		}
	}
	if(n!=1) vec.push_back(n);
}
int main(){
	int n,k;
	while(cin>>n>>k){
		vec.clear();
		fun(n);
		if(vec.size()<k) cout<<-1<<endl;
		else{
			for(int i=0;i<k-1;i++){
				cout<<vec[i]<<' ';
			}
			int ans=1;
			for(int i=k-1;i<vec.size();i++){
				ans*=vec[i];
			}
			if(ans>1){
				cout<<ans<<endl;
			}
		}
	}
}