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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author hltx39
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 1 <= n, k <= 10^10;
            long n = in.nextLong();
            long k = in.nextLong();
            // basic check to prevent overflow
            if (k >= (long) Math.sqrt(2 * n) + 1) {
                out.println(-1);
                return;
            }
            long sum = k * (k - 1) / 2;
            long gcd = 0;
            for (int d = 1; d <= (int) Math.sqrt(n); d++) {
                if (n % d == 0) {
                    long d2 = n / d;
                    if (d2 - sum > k - 1) gcd = Math.max(gcd, d);
                    if (d - sum > k - 1) gcd = Math.max(gcd, d2);
                }
            }
            if (gcd > 0) {
                int i = 1;
                while (i < k) {
                    out.print(gcd * i++);
                    out.print(" ");
                }
                out.println(n - sum * gcd);
            } else {
                out.println(-1);
            }
        }

    }
}

