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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Hieu Le
 */
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) {
            long n = in.nextLong();
            long k = in.nextLong();
            BigInteger sum = BigInteger.valueOf(k + 1).multiply(BigInteger.valueOf(k)).divide(BigInteger.valueOf(2));

            long upperBound = (long) Math.sqrt(n);
            long maxGcd = -1;
            for (long d = 1; d <= upperBound; ++d) {
                if (n % d == 0) {
                    if (validate(n, d, sum))
                        maxGcd = Math.max(d, maxGcd);
                    if (validate(n, n / d, sum))
                        maxGcd = Math.max(n / d, maxGcd);
                }
            }

            if (maxGcd == -1) {
                out.println(-1);
                return;
            }

            long residue = n;
            for (int i = 0; i < k - 1; ++i) {
                long value = (long) (i + 1) * maxGcd;
                out.print(value + " ");
                residue -= value;
            }

            out.println(residue);
        }

        private boolean validate(long n, long d, BigInteger sum) {
            return sum.compareTo(BigInteger.valueOf(n / d)) <= 0;
        }

    }

    static class InputReader {
        private BufferedReader reader;
        private StringTokenizer tokenizer;
        private static final int BUFFER_SIZE = 32768;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(
                    new InputStreamReader(stream), BUFFER_SIZE);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

    }
}

