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
/*
Keep solving problems.
*/

import java.math.BigInteger;
import java.util.*;
import java.io.*;
import java.util.stream.IntStream;

public class CFA {
    BufferedReader br;
    PrintWriter out;
    StringTokenizer st;
    boolean eof;
    private static long MOD = 1000L * 1000L * 1000L + 7;
    private static final int[] dx = {0, -1, 0, 1};
    private static final int[] dy = {1, 0, -1, 0};
    private static final String yes = "Yes";
    private static final String no = "No";

    long n;
    long k;
    void solve() throws IOException {
        n = nextLong();
        k = nextLong();
        if (k == 1) {
            outln(n);
            return;
        }

        BigInteger bigInteger = new BigInteger(Long.toString(k));
        bigInteger = bigInteger.multiply(new BigInteger(Long.toString(k)));
        BigInteger other = new BigInteger(Long.toString(n));
        other = other.multiply(new BigInteger("2"));
        if (bigInteger.compareTo(other) > 0) {
            outln(-1);
            return;
        }

        List<Long> res = new ArrayList<>();
        long val = -1;
        for (long i = 1; i * i <= n; i++) {
            if (n % i == 0) {
                if (n / i >= k * (k + 1) / 2) {
                    val = Math.max(val, i);
                }

                if (i >= k * (k + 1) / 2) {
                    val = Math.max(val, n / i);
                }
            }
        }

        if (val == -1) {
            outln(-1);
            return;
        }

        long need = n / val;
        for (long i = 0; i < k - 1; i++) {
            res.add(i + 1);
        }

        need -= (k - 1) * k / 2;
        res.add(need);
        for (long v : res) {
            out(val * v + " ");
        }
    }

    void shuffle(int[] a) {
        int n = a.length;
        for(int i = 0; i < n; i++) {
            int r = i + (int) (Math.random() * (n - i));
            int tmp = a[i];
            a[i] = a[r];
            a[r] = tmp;
        }
    }
    long gcd(long a, long b) {
        while(a != 0 && b != 0) {
            long c = b;
            b = a % b;
            a = c;
        }
        return a + b;
    }
    private void outln(Object o) {
        out.println(o);
    }
    private void out(Object o) {
        out.print(o);
    }
    private void formatPrint(double val) {
        outln(String.format("%.9f%n", val));
    }
    public CFA() throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        solve();
        out.close();
    }
    public static void main(String[] args) throws IOException {
        new CFA();
    }

    public long[] nextLongArr(int n) throws IOException{
        long[] res = new long[n];
        for(int i = 0; i < n; i++)
            res[i] = nextLong();
        return res;
    }
    public int[] nextIntArr(int n) throws IOException {
        int[] res = new int[n];
        for(int i = 0; i < n; i++)
            res[i] = nextInt();
        return res;
    }
    public String nextToken() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                eof = true;
                return null;
            }
        }
        return st.nextToken();
    }
    public String nextString() {
        try {
            return br.readLine();
        } catch (IOException e) {
            eof = true;
            return null;
        }
    }
    public int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }
    public long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
    public double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
}