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

public class C {

    boolean check(long n, long k) {
        BigInteger bigN = BigInteger.valueOf(n);
        BigInteger bigK = BigInteger.valueOf(k);
        return bigN.compareTo(bigK.multiply(bigK.add(BigInteger.valueOf(1L))).divide(BigInteger.valueOf(2))) >= 0;
    }

    void gen(long n, long k, long div) {
        for (int i = 0; i < k - 1; i++) {
            output.print((i + 1) * div + " ");
            n -= i + 1;
        }
        output.print(n * div);
    }

    public void solve() throws IOException {
        long n = nextLong();
        long k = nextLong();
        long sqrt = (long)Math.sqrt(n) + 1;

        ArrayList<Long> divs = new ArrayList<>();
        for (long i = 1; i <= sqrt; i++) {
            if (n % i == 0) {
                divs.add(n / i);
                divs.add(i);
            }
        }

        divs.sort(Long::compareTo);
        boolean ans = false;
        //arr = new long[(int)k];
        for (int i = divs.size() - 1; i >= 0; i--) {
            if (check(n / divs.get(i), k)) {
                gen(n / divs.get(i), k, divs.get(i));
                ans = true;
                break;
            }
        }
        if (!ans)
            output.println(-1);
    }

    public BufferedReader input;
    public PrintWriter output;
    public StringTokenizer stringTokenizer = new StringTokenizer("");

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

    C() throws IOException {
        input = new BufferedReader(new InputStreamReader(System.in));
        output = new PrintWriter(System.out);
        solve();
        input.close();
        output.close();
    }

    public String next() throws IOException {
        while (!stringTokenizer.hasMoreTokens() || stringTokenizer == null)
            stringTokenizer = new StringTokenizer(input.readLine());

        return stringTokenizer.nextToken();
    }

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

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

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