Problem: 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.

Solution (in PYTHON):

Solution:
test = raw_input("")

test_split = test.split(" ")

def to_integer(t):
    return int(t)

def to_str(t):
    return str(t)

map_2 = map(to_integer, test_split)

n = map_2[0]
k = map_2[1]

calc = n - k

list1 = []

for i in range(1,n+1):
    list1.append(i)


if k == 0:
    lastk = []
else:
    lastk = list1[-k:]
first = list1[:(n-k)]



if len(first)>= 1:
    withoutlast = first.pop()
    first = [withoutlast] + first

result = map(to_str, first + lastk)

if n == k:
    print -1
else:
    print " ".join(result)