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 JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
import java.util.Collections;

/**
 * Built using CHelper plug-in Actual solution is at the top
 *
 * @author dima
 */
public class Main {

    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {

        int N;

        public void solve(int testNumber, Scanner in, PrintWriter out) {
            N = in.nextInt();
            final int K = in.nextInt();
            if ((K & 1) == 0 || getMaxCalls(N) < K) {
                out.print(-1);
            } else {
                Integer[] result = new Integer[N];
                int next = N;
                for (int i = 0; i < N; ++i, --next) {
                    result[i] = next;
                }
                solve(result, 0, N, K);
                for (int i = 0; i < N; ++i) {
                    out.print(result[i]);
                    out.print(' ');
                }
            }
        }

        int getMaxCalls(int l) {
            int log1 = 31 - Integer.numberOfLeadingZeros(l);
            int log2 = log1 + 1;
            return (1 << log2) - 1 + ((l & (1 << log1) - 1) * 2);
        }

        void solve(Integer[] a, int start, int end, int K) {
            if (K == 1) {
                setBest(a, start, end);
            } else if (K == getMaxCalls(end - start)) {
                setWorst(a, start, end);
            } else if (end - start > 1) {
                int mid = start + ((end - start) >> 1);
                int maxLeft = getMaxCalls(mid - start);
                int maxRight = getMaxCalls(end - mid);
                K -= 1;
                if (maxRight <= K - 1) {
                    setWorst(a, mid, end);
                    K -= maxRight;
                    solve(a, start, mid, K);
                } else if (maxLeft <= K - 1) {
                    setWorst(a, start, mid);
                    K -= maxLeft;
                    solve(a, mid, end, K);
                } else {
                    setBest(a, mid, end);
                    solve(a, start, mid, K - 1);
                }
            }
        }

        void setWorst(Integer[] a, int start, int end) {
            Arrays.sort(a, start, end, Collections.reverseOrder());
        }

        void setBest(Integer[] a, int start, int end) {
            Arrays.sort(a, start, end);
        }

    }
}