Levko loves permutations very much. A permutation of length n is a sequence of distinct positive integers, each is at most n.

Let’s assume that value gcd(a, b) shows the greatest common divisor of numbers a and b. Levko assumes that element pi of permutation p1, p2, ... , pn is good if gcd(i, pi) > 1. Levko considers a permutation beautiful, if it has exactly k good elements. Unfortunately, he doesn’t know any beautiful permutation. Your task is to help him to find at least one of them.

Input

The single line contains two integers n and k (1 ≤ n ≤ 105, 0 ≤ k ≤ n).

Output

In a single line print either any beautiful permutation or -1, if such permutation doesn’t exist.

If there are multiple suitable permutations, you are allowed to print any of them.

Examples

Input

4 2


Output

2 4 3 1

Input

1 1


Output

-1

Note

In the first sample elements 4 and 3 are good because gcd(2, 4) = 2 > 1 and gcd(3, 3) = 3 > 1. Elements 2 and 1 are not good because gcd(1, 2) = 1 and gcd(4, 1) = 1. As there are exactly 2 good elements, the permutation is beautiful.

The second sample has no beautiful permutations.
# CF210B.py

def beautiful(n, k):
    if (n == k):
        return -1
    if (k == 1 and n == 1):
        return -1
    if (k == n-1):
        perm = []
        for i in xrange(n):
            perm += [i+1]
        return perm
    if (k == n-2):
        perm = range(1, n+1)
        temp = perm[0]
        temp1 = perm[-1]
        perm[-1] = temp
        perm[0] = temp1
        return perm
    else:
        perm = range(1, n+1)
        if (n - k == 1):
            temp = perm[0]
            perm[0] = perm[-1]
            perm[-1] = temp
            return perm
        for i in xrange(k+1, n, 2):
            if (i == n-1):
                temp = perm[0]
                perm[0] = perm[-1]
                perm[-1] = temp
            else:
                temp = perm[i]
                perm[i] = perm[i+1]
                perm[i+1] = temp
        return perm

x = raw_input("").split(' ')
n = int(x[0])
k = int(x[1])
answer = beautiful(n, k)
if (answer == -1):
    print -1
else:
    output = ""
    for i in xrange(n):
        output += str(answer[i]) + " "
    print output
