Problem: Bizon the Champion isn't just friendly, he also is a rigorous coder.

Let's define function f(a), where a is a sequence of integers. Function f(a) returns the following sequence: first all divisors of a1 go in the increasing order, then all divisors of a2 go in the increasing order, and so on till the last element of sequence a. For example, f([2, 9, 1]) = [1, 2, 1, 3, 9, 1].

Let's determine the sequence Xi, for integer i (i ≥ 0): X0 = [X] ([X] is a sequence consisting of a single number X), Xi = f(Xi - 1) (i > 0). For example, at X = 6 we get X0 = [6], X1 = [1, 2, 3, 6], X2 = [1, 1, 2, 1, 3, 1, 2, 3, 6].

Given the numbers X and k, find the sequence Xk. As the answer can be rather large, find only the first 105 elements of this sequence.

Input

A single line contains two space-separated integers — X (1 ≤ X ≤ 1012) and k (0 ≤ k ≤ 1018).

Output

Print the elements of the sequence Xk in a single line, separated by a space. If the number of elements exceeds 105, then print only the first 105 elements.

Examples

Input

6 1


Output

1 2 3 6 


Input

4 2


Output

1 1 2 1 2 4 


Input

10 3


Output

1 1 1 2 1 1 5 1 1 2 1 5 1 2 5 10 

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
 
public class A {
	
	static TreeSet<Long> primes = new TreeSet<>();
	static TreeMap<Long, ArrayList<Long>> divs = new TreeMap<>();
	
	static void factorize(long X)
	{
		for(long i = 2; i * i <= X; ++i)
			if(X % i == 0)
			{
				primes.add(i);
				while(X % i == 0)
					X /= i;
			}
		if(X != 1)
			primes.add(X);
	}
	
	static StringBuilder ans = new StringBuilder();
	
	static long f(long x, long k, long l)
	{
		if(l == 0)
			return 0;
		
		if(k == 0)
		{
			ans.append(x + " ");
			return l - 1;
		}
		
		if(primes.contains(x))
		{
			while(k > 0 && l > 0)
			{
				ans.append("1 ");
				--k;
				--l;
			}
			if(l > 0)
			{
				ans.append(x + " ");
				return l - 1;
			}
			return 0;
		}
		ans.append("1 ");
		--l;
		
		ArrayList<Long> xDivs = divs.get(x);
		if(xDivs == null)
		{
			divs.put(x, xDivs = new ArrayList<>());
			long d = 2;
			while(l > 0 && d * d < x)
			{
				if(x % d == 0)	
				{
					xDivs.add(d);
					l = f(d, k - 1, l);
				}
				++d;
			}
			if(d * d == x)
				++d;
			while(l > 0 && --d >= 1)
				if(x % d == 0)
				{
					xDivs.add(x / d);
					l = f(x / d, k - 1, l);
				}
		}
		else
		{
			for(int i = 0, end = xDivs.size(); i < end && l > 0; ++i)
				l = f(xDivs.get(i), k - 1, l);
		}
		return l;
	}
	
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
	
		long X = sc.nextLong(), K = sc.nextLong();
		if(X == 1)
			out.println(1);
		else
		{
			factorize(X);
			f(X, K, 100000);
			out.println(ans);			
		}
		out.flush();
		out.close();
	}
	
	static class Scanner 
	{
		StringTokenizer st;
		BufferedReader br;
 
		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}
	 
		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
 
		public int nextInt() throws IOException {return Integer.parseInt(next());}
 
		public long nextLong() throws IOException {return Long.parseLong(next());}
 
		public String nextLine() throws IOException {return br.readLine();}
 
		public double nextDouble() throws IOException { return Double.parseDouble(next()); }
 
		public boolean ready() throws IOException {return br.ready();} 
	}
}