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

/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
	public static BigInteger n,k;
	public static ArrayList<Long> dv = new ArrayList<Long>();

	public static BigInteger sn(BigInteger n, BigInteger a){
		return n.multiply(a.multiply(BigInteger.valueOf(2)).add(n.subtract(BigInteger.ONE).multiply(a))).divide(BigInteger.valueOf(2));
	}
	
	public static boolean can(BigInteger mid){
		BigInteger sum = sn(k.subtract(BigInteger.ONE), mid);
		BigInteger remain = n.subtract(sum);
		if(remain.compareTo(mid.multiply(k))!=-1) return true;
		return false;
	}

	public static int bs(int l, int r){
		if(l>r) return -1;
		int mid = (l+r)/2;
		if(can(BigInteger.valueOf(dv.get(mid)))) return Math.max(mid, bs(mid+1, r));
		return bs(l, mid-1);
	}
	
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }
    static class TaskA {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
			Long nn, kk;
			nn = in.nextLong();
			kk = in.nextLong();
			n = BigInteger.valueOf(nn);
			k = BigInteger.valueOf(kk);
			for(Long i=1L;i*i<=nn;i++){
				if(nn%i==0){
					dv.add(i);
					if(i*i!=nn) dv.add(nn/i);
				}
			}
			Collections.sort(dv);
			int ans = bs(0, dv.size()-1);
			if(ans==-1){
				out.println(ans);
				return;
			}
			Long x = dv.get(ans);
			Long y = x;
			Long sum = 0L;
			for(Long i=0L;i<kk-1L;i++){
				out.print(x+" ");
				sum += x;
				x += y;
			}
			out.println(nn-sum);
        }

    }
	
	public static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public Long nextLong() {
            return Long.parseLong(next());
        }
		
		public BigDecimal nextBigDecimal(){
			BigDecimal x = new BigDecimal(next());
			return x;
		}
    }
}
