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.util.ArrayList;
import java.util.StringTokenizer;

public class Main
{

    static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;

        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;
        }
    }

    public static void main(String[] args)
    {
        setup();
        xuly();
    }

    private static long n, k, ans = 1;
    private static ArrayList<Long> divisor = new ArrayList<>();
    private static ArrayList<Integer> power = new ArrayList<>();

    private static void setup() {
        FastReader fastReader = new FastReader();
        n = fastReader.nextLong();
        k = fastReader.nextLong();
        if (k > 150000)
        {
            System.out.print(-1);
            System.exit(0);
        }
    }

    private static void listDivisor(long x)
    {
        long temp = x;
        double limit = Math.sqrt(temp);
        for (int i = 2; i <= limit; i ++)
        if (temp % i == 0)
        {
            divisor.add((long) i);
            int pow = 0;
            while (temp % i == 0)
            {
                temp /= i;
                pow ++;
            }
            power.add(pow);

            limit = Math.sqrt(temp);
        }
        if (temp != 1)
        {
            divisor.add(temp);
            power.add(1);
        }
    }

    private static void dfs(long curVal, int id, long sumAfter)
    {
        if (n / curVal >= sumAfter && curVal > ans)
            ans = curVal;
        for (int i = id + 1; i < divisor.size(); i ++)
        {
            long divi = divisor.get(i), powe = power.get(i);
            long temp = curVal;
            for (int j = 0; j < powe; j ++)
                dfs(temp *= divi, i, sumAfter);
        }
    }

    private static void xuly()
    {
        long sumAfter = k * (k + 1) / 2;
        if (n < sumAfter)
        {
            System.out.print(-1);
            return;
        }

        listDivisor(n);
        dfs(1, -1, sumAfter);

        for (int i = 1; i < k; i ++)
        {
            n -= ans * i;
            System.out.print(ans * i + " ");
        }
        System.out.print(n);
    }
}
