#include <iostream>
#include <vector>
using namespace std;
const int N = 2e5+5, LOG = 20;

int left_child[N], right_child[N];

/**
 * constructs a subtree with the nodes in the range [l,r] of height h
 * @param l left endpoint of the range
 * @param r right endpoint of the range
 * @param h height of the subtree
 * @return the subtree root
 */
int construct(int l, int r, int h){
    if(l > r)
        return 0;

    int mid = (l+r) / 2;
    int root;
    // check if the requested height can be obtained when the mid is used as a root
    if(r-mid+1 >= h)
        root = mid;
    else
        root = r-h+1;

    // get the requested height from the right child
    right_child[root] = construct(root + 1, r, h - 1);
    // just ensure the left child does not have a greater height than the right
    left_child[root] = construct(l, root - 1, min(h - 1, root - l));

    return root;
}

void get_order(int node, vector<int>& order){
    order.push_back(node);
    if(left_child[node] != 0)
        get_order(left_child[node], order);
    if(right_child[node] != 0)
        get_order(right_child[node], order);
}

int main() {
    int n, h;
    cin >> n >> h;

    // Check if the requested height can be obtained
    if (h > n || (h < LOG && n > (1 << h) - 1)) {
        cout << "impossible" << endl;
        return 0;
    }

    // construct the tree
    int root = construct(1, n, h);
    // Generate the insertion order of the nodes
    vector<int> insertion_order;
    get_order(root, insertion_order);

    // Output the insertion order
    for (int i = 0; i < n; i++) {
        cout << insertion_order[i] << " ";
    }
    cout << endl;

    return 0;
}