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.util.StringTokenizer;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
public class E448 
{
    static class Scanner
    {
        BufferedReader br;
        StringTokenizer tk=new StringTokenizer("");
        public Scanner(InputStream is) 
        {
            br=new BufferedReader(new InputStreamReader(is));
        }
        public int nextInt() throws IOException
        {
            if(tk.hasMoreTokens())
                return Integer.parseInt(tk.nextToken());
            tk=new StringTokenizer(br.readLine());
            return nextInt();
        }
        public long nextLong() throws IOException
        {
            if(tk.hasMoreTokens())
                return Long.parseLong(tk.nextToken());
            tk=new StringTokenizer(br.readLine());
            return nextLong();
        }
        public String next() throws IOException
        {
            if(tk.hasMoreTokens())
                return (tk.nextToken());
            tk=new StringTokenizer(br.readLine());
            return next();
        }
        public String nextLine() throws IOException
        {
            tk=new StringTokenizer("");
            return br.readLine();
        }
        public double nextDouble() throws IOException
        {
            if(tk.hasMoreTokens())
                return Double.parseDouble(tk.nextToken());
            tk=new StringTokenizer(br.readLine());
            return nextDouble();
        }
        public char nextChar() throws IOException
        {
            if(tk.hasMoreTokens())
                return (tk.nextToken().charAt(0));
            tk=new StringTokenizer(br.readLine());
            return nextChar();
        }
        public int[] nextIntArray(int n) throws IOException
        {
            int a[]=new int[n];
            for(int i=0;i<n;i++)
                a[i]=nextInt();
            return a;
        }
        public long[] nextLongArray(int n) throws IOException
        {
            long a[]=new long[n];
            for(int i=0;i<n;i++)
                a[i]=nextLong();
            return a;
        }
        public int[] nextIntArrayOneBased(int n) throws IOException
        {
            int a[]=new int[n+1];
            for(int i=1;i<=n;i++)
                a[i]=nextInt();
            return a;
        }
        public long[] nextLongArrayOneBased(int n) throws IOException
        {
            long a[]=new long[n+1];
            for(int i=1;i<=n;i++)
                a[i]=nextLong();
            return a;
        }
    
    
    }
    static long p[];
    static boolean pr[];
    static PrintWriter out;
    static int max=100000;
    static void solve(int x,long k)
    {
        if(k==0)
        {
            out.print(p[x]+" ");
            max--;
            return;
        }
        if(x==0)
        {
            out.print(1+" ");
            max--;
            return;
        }
        if(pr[x])
        {
            if(max<k+1)
            {
                for(int i=0;i<max;i++)
                    out.print("1 ");
                max=0;
            }
            else
            {
                for(int i=0;i<k;i++)
                    out.print("1 ");
                out.print(p[x]+" ");
                max--;
                max-=k;
                
            }
            return;
        }
        for(int i=0;i<=x;i++)
        {
            if(p[x]%p[i]==0)
                solve(i,k-1);
            if(max==0)
                break;
        }
        
    }
    public static void main(String args[]) throws IOException
    {
        Scanner in=new Scanner(System.in);
        out=new PrintWriter(System.out);
        long x=in.nextLong();
        long k=in.nextLong();
        long sq=(long)Math.sqrt(x);
        if((sq+1)*(sq+1)==x)
            sq++;
        ArrayList<Long> l1=new ArrayList<>(),l2=new ArrayList<>();
        
        for(long i=1;i<=sq;i++)
        {
            if(x%i==0)
            {
                long v=x/i;
                l1.add(i);
                if(v!=i)
                    l2.add(v);
            }
        }
        Collections.reverse(l2);
        l1.addAll(l2);
        int n=l1.size();
        p=new long[n];
        pr=new boolean[n];
        Arrays.fill(pr, true);
        for(int i=0;i<n;i++)
            p[i]=l1.get(i);
        
        for(int i=1;i<n;i++)
        {
            if(pr[i])
                for(int j=i+1;j<n;j++)
                    if(p[j]%p[i]==0)
                        pr[j]=false;
        }
        solve(n-1,k);
        out.println();
        out.close();
    }

}