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.util.*;
import java.math.*;
 
public class Edu20Q4
{
    public static void main(String[] args) throws IOException
    {
        FastScanner obj = new FastScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));
		
		
		long n = obj.nextLong();
		long k = obj.nextLong();
		
		ArrayList<Long> divisors = new ArrayList<>();
		
		for(long i=1;i*i<=n;i++)
		{
			if(n%i==0)
			{
				divisors.add(i);
				divisors.add(n/i);
			}
		}	
		
		Collections.sort(divisors);
		long ans = -1;		
		for(int i=0;i<divisors.size();i++)
		{
			long d = divisors.get(i);
			long sum = d*((k*(k-1))/2);
			if(n-sum<0 || sum<0)
				continue;
			if(n-sum>(k-1)*d)
				ans = Math.max(ans,d);
							
		}	
		if(ans>0)
		{
			for(int i=1;i<k;i++)
				System.out.print(i*ans+" ");
			out.println(n - ans*((k*(k-1))/2));
		}
		else
			out.println(ans);
		out.close();
	}
   //-----------PrintWriter for faster output---------------------------------
   public static PrintWriter out;
      
   //-----------FastScanner class for faster input----------
   public static class FastScanner {
        BufferedReader br;
        StringTokenizer tokenizer;
 
        public FastScanner() throws IOException {
            br = new BufferedReader(new InputStreamReader(System.in));
            tokenizer = new StringTokenizer(br.readLine().trim());
        }
 
        String next() {
            while (tokenizer == null || !tokenizer.hasMoreElements()) {
                try {
                    tokenizer = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                    }
            }
          return tokenizer.nextToken();
        }
 
        int nextInt() {
            return Integer.parseInt(next());
        }
 
        long nextLong() {
            return Long.parseLong(next());
        }
 
        double nextDouble() {
            return Double.parseDouble(next());
        }
      
        int[] nextIntArray() throws IOException {
            String[] line = br.readLine().trim().split(" ");
            int[] out = new int[line.length];
            
            for (int i = 0; i < line.length; i++) {
                out[i] = Integer.valueOf(line[i]);
            }
            return out;
        }
        
        BigInteger nextBigInteger() throws IOException {
            return new BigInteger(next());
        }
        
        String nextLine(){
            String str = "";
	        try {
	            str = br.readLine();
	        } catch (IOException e) {
	            e.printStackTrace();
	        }
	        return str;
        }

   }
   //--------------------------------------------------------
}