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 Task{

static BufferedReader s1;
static BufferedWriter out;
static String read() throws IOException{String line="";while(line.length()==0){line=s1.readLine();continue;}return line;}
static int int_v (String s1){return Integer.parseInt(s1);}
static long long_v(String s1){return Long.parseLong(s1);}
static int[] int_arr() throws IOException{String[] a=read().split(" ");int[] b=new int[a.length];for(int i=0;i<a.length;i++){b[i]=int_v(a[i]);}return b;}
static long[] long_arr() throws IOException{String[] a=read().split(" ");long[] b=new long[a.length];for(int i=0;i<a.length;i++){b[i]=long_v(a[i]);}return b;}
static void assign(){s1=new BufferedReader(new InputStreamReader(System.in));out=new BufferedWriter(new OutputStreamWriter(System.out));}
//......................................@uthor_Alx..............................................
static boolean ok(long n, long g, long k){
	if(k>=1000000) return false;
	long xx=k*(k+1l);xx/=2;
	if(n/g>=xx) return true;
	return false;
}
public static void main(String[] args) throws  IOException{
				assign();
				int t=1;//int_v(read()),cn=1;
				while(t--!=0){
					long[] z=long_arr();
					long n=z[0],k=z[1];
					long g=-1;
					for(int i=1;i<=(int)Math.sqrt(n)+1;i++){
						if(n%i!=0) continue;
						long d1=n/i,d2=i;
						if(g<d1&&ok(n,d1,k)){
							g=d1;
						}
						if(g<d2&&ok(n,d2,k)){
							g=d2;
						}
					}
					if(g==-1){out.write("-1");}
					else{
						//out.write(g+"\n");
						for(int i=1;i<k;i++){
							out.write((long)g*i+" ");
						}
						k=k*(k-1);k/=2;k*=g;n-=k;
						out.write(n+"");
					}
				}			    
			    out.flush();

	}
}