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.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;


public class q5 {
	static ArrayList<Integer>[] gph;
	static long fact[];static long mod;
	
	
	public static void main(String[] args) throws IOException {
		
		Reader.init(System.in);
		PrintWriter out=new PrintWriter(System.out);
		StringBuffer output=new StringBuffer("");
		long n=Reader.nextLong();
		long k=Reader.nextLong();
		int c=(int) Math.sqrt(n);
		
		if(k>=(1000000)) {
			out.println(-1);
		}
		else {
			boolean found=false;
			long val=-1;
			ArrayList<Long> div=new ArrayList<Long>();
			for(int i=1;i<=c;i++) {
				if(n%i==0) {
					div.add((long)i);
					if(i!=n/i) div.add(n/i);
				}
			}
			Collections.sort(div);
			
		int l=div.size();
		long sum=(k*(k+1))/2;
		for(int i=l-1;i>=0;i--) {
				long v=div.get(i);
				if(n/v>=sum) {
					found=true;
					val=v;
					break;
				}
			}
		if(found) {
			sum-=k;
			for(int i=1;i<k;i++) {
				out.print((val*i)+" ");n-=i*val;
			}
			out.print(n);
		}
		else out.println(-1);
		}
		
		out.flush();
	}
}



class NoD{
	
}







class Reader {
    static BufferedReader reader;
    static StringTokenizer tokenizer;
    /** call this method to initialize reader for InputStream */
    static void init(InputStream input) {
        reader = new BufferedReader(
                     new InputStreamReader(input) );
        tokenizer = new StringTokenizer("");
    }
    /** get next word */
    static String nextLine() throws IOException{
    	return reader.readLine();
    }
    static String next() throws IOException {
        while ( ! tokenizer.hasMoreTokens() ) {
            //TODO add check for eof if necessary
            tokenizer = new StringTokenizer(
                   reader.readLine() );
        }
        return tokenizer.nextToken();
    }
    static int nextInt() throws IOException {
        return Integer.parseInt( next() );
    }
    static long nextLong() throws IOException {
        return Long.parseLong( next() );
    }
    static double nextDouble() throws IOException {
        return Double.parseDouble( next() );
    }
}