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.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;


public class CodeForces {

    //mkpcmlpkkkogrg - expected: 'pcmlkorg', found: 'mpclkorg'
    static FastScanner scanner = new FastScanner();

    static List<Long>  finalList = new ArrayList<>();
    static long maxgcd = 0l;

    public static void main(String[] args) {
        long n = scanner.nextLong();
        long k = scanner.nextLong();
        //CodeForces obj = new CodeForces();
        //log(k);
        if(k==1){
            log(n);
        }else if(k>=1000000l){
            log("-1");

        }else if(getmin(k)>n){
            log("-1");
        }else{
            long gcd=0, qu=0;
            long minVal = getmin(k);
            ArrayList<Long> bigd  = new ArrayList<>();
            for(long i=2; i*i<=n; i++){
                if(n%i==0){
                    long q = n/i;
                    bigd.add(i);
                    bigd.add(q);

                }
            }

            //logintarrayllist(bigd);

            for(Long a: bigd){
                long q = n/a;
                if(q>=minVal){
                    if(a>gcd){
                        gcd=a;
                        qu=q;
                    }

                }
            }



            if(gcd==0){
                for(int i=1; i<k; i++){
                    finalList.add(Long.valueOf(i));
                }
                finalList.add((n-(minVal-k)));
                logintarrayllist(finalList);
            }else{
                for(int i=1; i<k; i++){
                    finalList.add(Long.valueOf(i)*gcd);
                }
                //log(qu);
                finalList.add((qu-(minVal-k))*gcd);
                logintarrayllist(finalList);
            }





        }

        //Collections.reverse(obj.finalList);


    }



    private static long getmin(long val){
        return (val*(val+1))/2;
    }

    private static void logintarrayllist(List<Long> currList){
        for (Long a: currList) {
            System.out.print(a + " ");
        }
        System.out.println();
    }

    private static void logintarray(int[] arr){
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }

    private static void log(Object... args) {
        System.out.println(args[0]);
        // ...
    }


    static class FastScanner {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
        public FastScanner() {
            reader = new BufferedReader(new InputStreamReader(System.in), 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 double nextDouble() {
            return Double.parseDouble(next());
        }
        public String nextLine() {
            try {
                return reader.readLine();
            } catch(IOException e) {
                throw new RuntimeException(e);
            }
        }
    }


}
