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.
import itertools
import math
import random

import time
def timer(f):
    def tmp(*args, **kwargs):
        t = time.time()
        res = f(*args, **kwargs)
        print("Время выполнения функции: %f" % (time.time()-t))
        return res

    return tmp

def genArray(length, lower, upper):
    return [random.randint(lower, upper) for i in range(length)]

#print(genArray(5, 4, 9))

def gcd(a, b):
    if b==0:
        return a
    else:
        return gcd(b, a%b)

n, k = map(int, input().split(' '))
k = n-k

if k == 0:
    print(-1)
    exit(0)
else:
    array = [0 for i in range(n)]
    for j in range(k):
        array[j] = (j-1)%(k)+1
    for j in range(k, n):
        array[j] = j+1


ar = [i+1 for i in range(n)]
#print(ar)
#print(array)

total = 0
for i in range(n):
    if gcd(ar[i], array[i])==1:
        total+=1

#print(total)

str = array.__str__().replace('[', '').replace(']', '').replace(',', '')
print(str)