Problem: Merge sort is a well-known sorting algorithm. The main function that sorts the elements of array a with indices from [l, r) can be implemented as follows:

  1. If the segment [l, r) is already sorted in non-descending order (that is, for any i such that l ≤ i < r - 1 a[i] ≤ a[i + 1]), then end the function call; 
  2. Let <image>; 
  3. Call mergesort(a, l, mid); 
  4. Call mergesort(a, mid, r); 
  5. Merge segments [l, mid) and [mid, r), making the segment [l, r) sorted in non-descending order. The merge algorithm doesn't call any other functions. 



The array in this problem is 0-indexed, so to sort the whole array, you need to call mergesort(a, 0, n).

The number of calls of function mergesort is very important, so Ivan has decided to calculate it while sorting the array. For example, if a = {1, 2, 3, 4}, then there will be 1 call of mergesort — mergesort(0, 4), which will check that the array is sorted and then end. If a = {2, 1, 3}, then the number of calls is 3: first of all, you call mergesort(0, 3), which then sets mid = 1 and calls mergesort(0, 1) and mergesort(1, 3), which do not perform any recursive calls because segments (0, 1) and (1, 3) are sorted.

Ivan has implemented the program that counts the number of mergesort calls, but now he needs to test it. To do this, he needs to find an array a such that a is a permutation of size n (that is, the number of elements in a is n, and every integer number from [1, n] can be found in this array), and the number of mergesort calls when sorting the array is exactly k.

Help Ivan to find an array he wants!

Input

The first line contains two numbers n and k (1 ≤ n ≤ 100000, 1 ≤ k ≤ 200000) — the size of a desired permutation and the number of mergesort calls required to sort it.

Output

If a permutation of size n such that there will be exactly k calls of mergesort while sorting it doesn't exist, output  - 1. Otherwise output n integer numbers a[0], a[1], ..., a[n - 1] — the elements of a permutation that would meet the required conditions. If there are multiple answers, print any of them.

Examples

Input

3 3


Output

2 1 3 

Input

4 1


Output

1 2 3 4 

Input

5 6


Output

-1

Solution (in PYTHON3):

Solution:
'''
Based on solution from Firepaw which is awesome
'''

k1 = 0


def main():
    n, k = [int(x) for x in input().split()]
    if k & 1 == 0 or k > 2*n-1:
        print("-1")
    else:
        lst = [0]*n

        # k1 count how many recursions left, drain one for the initial  call
        global k1
        k1 = k - 1

        # solve the task for [l, r)
        # Filling array with values val, val+1, ...
        def fill_arr(l, r, val):
            global k1
            # list size 1, nothing to do just set the value
            if r <= l+1:
                lst[l] = val
            elif k1 == 0:
                # just fill in a sorted array - no more calls here
                for i in range(l, r):
                    lst[i] = val + i - l
            else:
                # drain 2 recursion calls (for left and right path)
                k1 -= 2
                # call subproblems
                m = (l+r) // 2
                # set initial vals for left path as [val + r-m, ... , val + r)
                fill_arr(l, m, val+r-m)

                # set initial vals for right path as [val, val+1, ... , val + r-m)
                fill_arr(m, r, val)

                # after filling subproblems we are sure list is not sorted
                # this justifies the draining k1

        fill_arr(0, n, 1)
        #assert(k1 == 0)
        print(" ".join(map(str, lst)))


if __name__ == "__main__":
    main()