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.io.PrintStream;
import java.util.Arrays;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.math.BigInteger;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(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, InputReader in, PrintWriter out) {
            BigInteger N = new BigInteger(in.next());
            BigInteger K = new BigInteger(in.next());
            BigInteger C = K.multiply(K.add(BigInteger.ONE)).divide(new BigInteger("2"));

            if (C.compareTo(N) > 0) {
                System.out.println(-1);
            } else {

                BigInteger i, d;
                i = d = BigInteger.ONE;

                while (i.pow(2).compareTo(N) <= 0) {
                    if (N.mod(i).equals(BigInteger.ZERO)) {
                        BigInteger b = N.divide(i);
                        if (i.multiply(C).compareTo(N) <= 0) d = i.compareTo(d) > 0 ? i : d;
                        if (b.multiply(C).compareTo(N) <= 0) d = b.compareTo(d) > 0 ? b : d;
                    }
                    i = i.add(BigInteger.ONE);
                }

                for (i = BigInteger.ONE; i.compareTo(K) < 0; i = i.add(BigInteger.ONE)) {
                    BigInteger temp = i.multiply(d);
                    N = N.add(temp.negate());
                    out.print(temp + " ");
                }
                out.println(N);
            }
        }

    }

    static class InputReader extends BufferedReader {
        private StringTokenizer st = new StringTokenizer("");

        public InputReader(InputStream in) {
            super(new InputStreamReader(in));
        }

        private boolean isAvailable() {
            return st != null && st.hasMoreTokens();
        }

        public String next() {
            if (!isAvailable()) {
                try {
                    st = new StringTokenizer(readLine());
                } catch (Exception e) {
                    System.err.println(Arrays.toString(e.getStackTrace()));
                }
            }
            return st.nextToken();
        }


        public void close() {
            try {
                super.close();
            } catch (Exception e) {
                System.err.println(Arrays.toString(e.getStackTrace()));
            }
        }


        public String readLine() {
            String s = null;
            try {
                s = super.readLine();
            } catch (Exception e) {
                System.err.println(Arrays.toString(e.getStackTrace()));
            }
            return s;
        }

    }
}

