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.util.*;
import java.io.*;
public class B{
	
	static boolean check(long num, long size, long sum)
	{
		long need = ((size*(size+1))/2l)*num;
		
		if(need>sum)return false;
//		if(num == 117504)System.out.println(need);
		if((sum-need)%num !=0 )return false;
		return true;
	}
	
	static long make(long n, long k)
	{
		long ret = -1;
		for(long i=1;i*i<=n;i++)
		{
			long first = i;
			long sec = n/i;
			if(check(first,k,n) == true)ret = Math.max(ret,first);
			if(check(sec,k,n) == true)ret = Math.max(ret,sec);
			
		}
		return ret;
	}
	
	public static void main(String[] args)
	{
		FastScanner fs = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		long n = fs.nextLong(); long k = fs.nextLong();
		if(k>=(int)(1e8))
		{
			out.println("-1");
			out.close();
			return;
		}
		long res = make(n,k);
		if(res == -1)
		{
			out.println("-1");
		}
		else
		{
//			System.out.println(res);
			long[] arr = new long[(int)k+1];
			long take = 0;
			for(int i=1;i<=k;i++)
			{
				arr[i] = (long)i*res;
				take += arr[i];
			}
			arr[(int)k] += (n-take);
			
			for(int i=1;i<=(int)k;i++)out.print(arr[i]+" ");
			
		}
		out.close();
	}
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		
		int nextInt() {
			return Integer.parseInt(next());
		}
		int[] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}
	public static int[] sort(int[] arr)
	{
		List<Integer> temp = new ArrayList();
		for(int i:arr)temp.add(i);
		Collections.sort(temp);
		int start = 0;
		for(int i:temp)arr[start++]=i;
		return arr;
	}
	public static String rev(String str)
	{
		char[] arr = str.toCharArray();
		char[] ret = new char[arr.length];
		int start = arr.length-1;
		for(char i:arr)ret[start--] = i;
		String ret1 = "";
		for(char ch:ret)ret1+=ch;
		return ret1;
	}
}