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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class Solver {

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

    static FastScanner in = new FastScanner();
    static PrintWriter out;
    static String s;
    static long n, k;
    void read() throws IOException {
        out = new PrintWriter(System.out);
        int test = 1;
        while (test-- > 0) {
            n = in.nextLong();
            k = in.nextLong();
            solve();
        }
        out.close();
    }

    void print(String s) {
        out.println(s);
    }

    void solve() throws IOException {
        if (k > 2e5 || (k * (k + 1) / 2) > n)
        {
            System.out.println(-1);
            return;
        }
            long gcd = 0;
            for (int i = 1; i <= Math.sqrt(n); i++) {
                if (n % i == 0) {
                    long cnt = n / i;
                    if (k * (k + 1) / 2 <= cnt) {
                        gcd = Math.max(gcd, i);
                    }
                    long cnt1 = i;
                    if (k * (k + 1) / 2 <= cnt1) {
                        gcd = Math.max(gcd, n/i);
                    }
                }
            }
            n/=gcd;
            long f = 1;
            int len = 0;
            while (len < k - 1){
                System.out.print(f * gcd + " ");
                n-=f;
                f++;
                len++;
            }
            System.out.print(n > 0 ? n * gcd : "");
    }
}


class FastScanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");

    String next() throws IOException {
        while (!st.hasMoreElements()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }

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

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