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 javax.print.attribute.IntegerSyntax;
import java.sql.Array;
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class MainS {
    static final long MOD = 1_000_000_007, INF = 1_000_000_000_000_000_000L;
    static final int INf = 1_000_000_000;
    static FastReader reader;
    static PrintWriter writer;

    public static void main(String[] args) {
        Thread t = new Thread(null, new O(), "Integer.MAX_VALUE", 100000000);
        t.start();
    }

    static class O implements Runnable {
        public void run() {
            try {
                magic();
            } catch (Exception e) {
                e.printStackTrace();
                System.exit(1);
            }
        }
    }

    public static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

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

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }

    static void magic() throws IOException {
        reader = new FastReader();
        writer = new PrintWriter(System.out, true);
        long n = reader.nextLong(), k = reader.nextLong();
        if(k>1000000) {
            writer.println(-1);
            System.exit(0);
        }
        if((k*(k+1))/2>n) {
            writer.println(-1);
            System.exit(0);
        }
        ArrayList<Long> divisors = new ArrayList<>();
        for(long i=1;i*i<=n;++i) {
            if(n%i!=0) {
                continue;
            }
            if(i*i==n) {
                divisors.add(i);
            }
            else {
                divisors.add(i);
                divisors.add(n/i);
            }
        }
        Collections.sort(divisors);
        long min = k*(k+1);
        min/=2;
        for(int i=divisors.size()-1;i>=0;--i) {
            long d = divisors.get(i);
            long left = n/d;
            if(left<min) {
                continue;
            }
            else {
                StringBuilder fast = new StringBuilder();
                long last = left - (k*(k-1))/2;
                for(long j=1;j<k;++j) {
                    fast.append(j*d);
                    fast.append(" ");
                }
                fast.append(last*d);
                writer.println(fast);
                break;
            }
        }
    }
}