#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define Gondozu ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);

using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;
using vpi = vector <pair<int, int>>;
using vvi = vector <vector<int>>;

const int OO = 1e9 + 5;
const int N = 2e5 + 5;

int lc[N], rc[N];

int slv(int l ,int r, int h){
    if(l>r)
        return 0;

    int mid = (l+r)/2, root;
    if(h == -1 || r-mid+1 >= h)
        root = mid;
    else
        root = r-h+1;
    rc[root] = slv(root+1,r,h-1);
    lc[root] = slv(l,root-1,-1);
    return root;
}

vi ans;
void dfs(int v){
    ans.pb(v);
    if(lc[v])
        dfs(lc[v]);
    if(rc[v])
        dfs(rc[v]);
}

void TC()
{
    int n, k;
    cin >> n >> k;
    if(k > n || k < (int)log2(n)+1)
        return void(cout << "impossible");
    int root = slv(1,n,k);
    dfs(root);
    for(int i : ans) cout << i << ' ';
}

int32_t main() {
#ifndef ONLINE_JUDGE
    freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#endif
    Gondozu
    int t = 1;
//    cin >> t;
    while (t--) {
        TC();
        cout << '\n';
    }
    return 0;
}