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.util.Scanner;

/**
 * Code Forces
 * 803C - Maximal GCD
 * @author coderWu
 * Created in 下午8:43 17-9-14
 */
public class Main {

    public static long sum;

    public static long count;

    public static long cd;

    public static long sqrt;

    public static long oneToK;

    public static void main(String[] args) {

        Scanner input = new Scanner(System.in);
        sum = Long.parseLong(input.next());
        count = Long.parseLong(input.next());
        sqrt = (long) Math.sqrt(sum);
        oneToK = (1 + count) * count / 2;
        cd = -1;

        //oneToK回大到呵呵呵
        if (count > 145000) {
            System.out.println(-1);
            System.out.println();
            return;
        }

        //求最大公因数
        for (long i = 1; i <= sqrt; i++) {
            if (sum % i == 0) {
                if (i >= oneToK) {
                    cd = sum / i;
                    break;
                } else if (sum / i >= oneToK){
                    cd = i;
                }
            }
        }

//        System.out.println(cd);
        if (cd == -1) {
            System.out.println(-1);
        } else {
            long addSum = 0;
            for (long i = 1; i < count; i++) {
                System.out.print(cd * i + " ");
                addSum += cd * i;
            }
            System.out.println(sum - addSum);
        }

        System.out.println();
    }

}

 	 		   				 		 	  	 		 		   	