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

public class cf803c {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		long n = in.nextLong();
		long k = in.nextLong();
		go(n, k);
	}

	public static void go(long n, long k) {
		// System.out.println(Arrays.toString(solve(n, k)));
		// System.out.println(maxi);
		ArrayDeque<Long> f = factors(n);
		ArrayList<Long> fact = new ArrayList<Long>();
		fact.addAll(f);
		Collections.sort(fact);
		Collections.reverse(fact);
		if (lowerbound(new BigInteger("" + n), new BigInteger("" + k)).compareTo(new BigInteger("" + n)) > 0) {
			System.out.println(-1);
			return;
		}
		// System.out.println(f);
		for (Long gcd : fact) {
			long[] attempt = solve(n / gcd, k);
			if (attempt == null)
				continue;
			for (int i = 0; i < attempt.length; i++) {
				attempt[i] *= gcd;
			}
			StringBuilder sb = new StringBuilder();
			for (int i = 0; i < attempt.length; i++) {
				sb.append(attempt[i] + " ");
			}
			System.out.println(sb.toString().trim());
			return;

		}
		System.out.println(-1);
	}

	public static ArrayDeque<Long> factors(long n) {
		ArrayDeque<Long> f = new ArrayDeque<Long>();
		for (long i = 1; i <= Math.sqrt(n) + .005; i++) {
			if (n % i == 0) {
				f.addFirst(i);
				f.addLast(n / i);
			}
		}
		return f;
	}

	public static BigInteger lowerbound(BigInteger n, BigInteger k) {
		return (k.multiply(k.add(BigInteger.ONE))).divide(new BigInteger("2"));
	}

	public static BigInteger upperbound(BigInteger n, BigInteger k) {
		BigInteger huh = n.subtract(k);
		if (huh.compareTo(BigInteger.ZERO) < 0) {
			huh = BigInteger.ZERO;
		}
		return lowerbound(n, n).subtract(lowerbound(n, huh));
	}

	// calculate for gcd = 1
	public static long[] solve(long n, long k) {
		// System.out.println(lowerbound(n,k)+" "+upperbound(n,k));
		if (lowerbound(new BigInteger(n + ""), new BigInteger(k + "")).compareTo(new BigInteger(n + "")) > 0
				|| upperbound(new BigInteger(n + ""), new BigInteger(k + "")).compareTo(new BigInteger("" + n)) < 0) {
			// System.out.println(lowerbound(n, k) + " " + upperbound(n, k) + "
			// " + n);
			return null;
		}
		// System.out.println(k+" "+lowerbound(n,k));
		long[] ans = new long[(int) k];
		long nn = n;
		for (int i = 0; i < ans.length; i++) {
			ans[i] = i + 1;
			n -= i + 1;
		}

		for (int i = ans.length - 1; i >= 0; i--) {
			if (n <= 0)
				break;
			long max = nn - (ans.length - i);
			// System.out.println(i + " " + max);
			long diff = max - ans[i];
			long act = Math.min(diff, n);
			ans[i] += act;
			n -= act;
		}
		return ans;
	}

}
