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.*;
import java.util.*;
import java.math.*;

public class Task implements Runnable {

    static long[] getDivisors(long n) {
        long[] r = new long[7100];
        int cnt = 0;
        for (long i = 1; i * i <= n; ++i) {
            if (n % i == 0) {
                r[cnt++] = i;
                if (i * i < n) {
                    r[cnt++] = n / i;
                }
            }
        }
        r = Arrays.copyOf(r, cnt);
        Arrays.sort(r);
        return r;
    }

    static int count = 100000;
    static long[] dv;
    static long[][] d;

    static void dfs(int v, int level) {
        if (count == 0) return;
        if (dv[v] == 1 || level == 0) {
            out.print(dv[v] + " ");
            --count;
            if (count == 0) {
                out.println();
            }
            return;
        }
        for (long p : d[v]) {
            dfs((int) p, level - 1);
            if (count == 0) return;
        }
    }

    public void solve() throws IOException {
        dv = getDivisors(in.nextLong());
        int k = (int) Math.min(100010L, in.nextLong());
        int cnt = dv.length;
        d = new long[cnt][];
        for (int i = 0; i < cnt; ++i) {
            d[i] = getDivisors(dv[i]);
            for (int j = 0; j < d[i].length; ++j) {
                long p = d[i][j];
                int l = -1;
                int r = dv.length;
                while (r - l > 1) {
                    int m = (l + r) / 2;
                    if (dv[m] >= p) {
                        r = m;
                    } else {
                        l = m;
                    }
                }
                d[i][j] = r;
            }
        }
        dfs(dv.length - 1, k);
    }

    public void run() {
        try {
            in = new FastReader();
            out = new PrintWriter(System.out);
            solve();
            out.close();
        } catch (IOException e) {
            e.printStackTrace();
            System.exit(1);
        }
    }

    static FastReader in;
    static PrintWriter out;

    public static void main(String[] args) throws IOException {
        new Task().run();
    }

}

class FastReader {
    BufferedReader br;
    StringTokenizer in;

    FastReader() {
        this.br = new BufferedReader(new InputStreamReader(System.in));
    }

    FastReader(String filename) {
        try {
            this.br = new BufferedReader(new FileReader(filename));
        } catch (IOException e) {
            e.printStackTrace();
            System.exit(1);
        }
    }

    public String nextToken() throws IOException {
        while (in == null || !in.hasMoreTokens()) {
            in = new StringTokenizer(br.readLine());
        }

        return in.nextToken();
    }

    public int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    public double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    public long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
}