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
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
raw_input = stdin.readline
pr = stdout.write


def in_num():
    return int(raw_input())


def in_arr():
    return map(int,raw_input().split())


def pr_num(n):
    stdout.write(str(n)+'\n')


def pr_arr(arr):
    pr(' '.join(map(str,arr))+'\n')

# fast read function for total integer input

def inp():
    # this function returns whole input of
    # space/line seperated integers
    # Use Ctrl+D to flush stdin.
    return map(int,stdin.read().split())

range = xrange # not for python 3.0+
def fun(x,n,k):
    sm=n-((x*k*(k-1))/2)
    return (sm>0 and sm/x>=k)
n,k=inp()
div=0
i=1
while i*i<=n:
    if n%i==0:
        if fun(i,n,k):
            div=max(div,i)
        if fun(n/i,n,k):
            div=max(div,n/i)
    i+=1
if not div:
    pr_num(-1)
else:
    sm=0
    i=div
    while i<=div*(k-1):
        pr(str(i)+' ')
        sm+=i
        i+=div
    pr(str(n-sm))
