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.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class P803C
{
	public static void main(String[] args)
	{
		Scanner scan = new Scanner(System.in);
		long n = scan.nextLong();
		long k = scan.nextLong();
		if (k > 200000)
		{
			System.out.println(-1);
			return;
		}
		ArrayList<Long> fact = new ArrayList<>();
		for (int i = 1; (long)i*i <= n; i++)
		{
			if (n % i == 0)
			{
				fact.add((long)i);
				if (i != n/i)
					fact.add(n/i);
			}
		}
		Collections.sort(fact);
		PrintWriter pw = new PrintWriter(System.out);
		for (int i = fact.size()-1; i >= 0; i--)
		{
			BigInteger big = BigInteger.valueOf(k);
			BigInteger big1 = BigInteger.valueOf(k+1);
			BigInteger sum = big.multiply(big1).divide(BigInteger.valueOf(2)).multiply(BigInteger.valueOf(fact.get(i)));
			BigInteger max = BigInteger.valueOf(n);
			if (sum.compareTo(max) > 0)
				continue;
			long curr = fact.get(i);
			long t = 0;
			for (int j = 0; j < k-1; j++)
			{
				pw.print(curr);
				pw.print(" ");
				t += curr;
				curr += fact.get(i);
			}
			pw.println(n - t);
			pw.flush();
			return;
		}
		System.out.println(-1);
	}
}
