You are given positive integer number n. You should create such strictly increasing sequence of k positive numbers a1, a2, ..., ak, that their sum is equal to n and greatest common divisor is maximal.

Greatest common divisor of sequence is maximum of such numbers that every element of sequence is divisible by them.

If there is no possible sequence then output -1.

Input

The first line consists of two numbers n and k (1 ≤ n, k ≤ 1010).

Output

If the answer exists then output k numbers — resulting sequence. Otherwise output -1. If there are multiple answers, print any of them.

Examples

Input

6 3


Output

1 2 3


Input

8 2


Output

2 6


Input

5 3


Output

-1
import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException {
        InputStream inputStream = System.in;
//        InputStream inputStream = new FileInputStream("dijkstra.in");
        OutputStream outputStream = System.out;
//        OutputStream outputStream = new FileOutputStream("dijkstra.out");


//        Path path = Paths.get(URI.create("file:///foo/bar/Main.java"));
//        System.out.print(path.getName(200));

//        Path p = Paths.get("/foo/bar/Main.java");
//        for (Path e : p) {
//            System.out.println(e);
//        }

        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Answer solver = new Answer();
        solver.solve(in, out);
        out.close();
    }
}

class Answer {
    private final int INF = (int) (1e9 + 7);

    public void solve(InputReader in, PrintWriter out) throws IOException {
        long n = in.nextLong();
        long k = in.nextLong();

        if ((double) k * (k + 1) > 2 * n) {
            out.print("-1");
            return;
        }

        if ((double) k * (k + 1) == 2 * n) {
            for (int i = 1; i <= k; i++) {
                out.print(i + " ");
            }
            out.println();
            return;
        }

        long mdel = -1;
        for (long i = 1; i * i <= n; i++) {
            if (n % i == 0) {
                long d = i;
                double s = (double) d * (k - 1) * k / 2;
                if ((double) n - s > (k - 1) * d) {
                    mdel = Math.max(d, mdel);
                }

                d = n / i;
                s = (double) d * (k - 1) * k / 2;
                if ((double) n - s > (k - 1) * d) {
                    mdel = Math.max(d, mdel);
                }
            }
        }

        if (mdel == -1) {
            out.print("-1");
            return;
        }

        for (int i = 1; i < k; i++) {
            out.print(mdel * i + " ");
        }
        long s = mdel * (k - 1) * k / 2;
        out.println(n - s);
    }
}

class InputReader {
    private BufferedReader reader;
    private StringTokenizer tokenizer;

    InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public long nextLong() {
        return Long.parseLong(next());
    }
}
