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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class CEdu20 {
	static final int oo = 20000000;
	public static void main(String[] args) {
		
		FS scan = new FS(System.in);
		
		long N = scan.nextLong(), K = scan.nextLong();
		
		if(K>1000000){
			System.out.println(-1);
			return;
		}
		boolean valid = true;
	
		int max =(int)Math.sqrt(N);
		long gcd = -1;
		long count = K*(K+1)/2;
		
		//System.out.println(count);
		for(long i=1;i<=max+1;i++){
			if(N%i==0){
				if(i*count<=N){
					gcd=Math.max(i, gcd);
				}else
					break;
				if(count > Long.MAX_VALUE / (N/i))continue;
				if((N/i)*count<=N){
					//System.out.println(i+" "+N/i+" "+(N/i)*count);
					gcd = Math.max(N/i, gcd);
					break;
				}
			}
		}
		if(gcd==-1){
			System.out.println(-1);
			return;
		}
		StringBuilder sol = new StringBuilder();
		
		//System.out.println(gcd);
		PrintWriter out = new PrintWriter(System.out);
		long temp = N/gcd;
		for(int i=1;i<=K;i++){
			if(i==K){
				sol.append(temp*gcd+" ");
				break;
			}
			else{
				sol.append(i*gcd+" ");
			}
			if(sol.length()>=oo){
				out.print(sol);
				sol = new StringBuilder();
			}
			temp-=i;
		}
		
		out.print(sol);
		out.close();
	}
	private static class FS {
		BufferedReader br;
		StringTokenizer st;
		public FS(InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}
		String next(){
			while(st==null||!st.hasMoreElements()){
				try{st = new StringTokenizer(br.readLine());}
				catch(IOException e){e.printStackTrace();}
			}
			return st.nextToken();
		}
		int nextInt() {
			return Integer.parseInt(next());
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}
}
