#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define MP make_pair
#define all(x) x.begin(),x.end()
#define Hagry 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 l[N], r[N], p[N], d[N], h[N], curH;

int build(int lt, int rt, int par) {
    if (lt > rt)return -1;
    int root = (lt + rt + 1) / 2;

    p[root] = par;
    d[root] = d[par] + 1;

    l[root] = build(lt, root - 1, root);
    r[root] = build(root + 1, rt, root);

    h[root] = max(h[l[root]], h[r[root]]) + 1;
    return root;
}

vi BFS(int root) {
    vi res;

    queue<int> q;
    q.push(root);

    while (!q.empty()) {
        int cur = q.front();
        q.pop();
        res.pb(cur);
        if (~l[cur])
            q.push(l[cur]);
        if (~r[cur])
            q.push(r[cur]);
    }
    return res;
}

void TC() {
    int n, k;
    cin >> n >> k;

    int root = build(1, n, 0);
    curH = h[root];
    if (curH > k) {
        cout << "impossible";
        return;
    }
    if(curH == k){
        vi ans = BFS(root);
        for(auto e:ans)
            cout << e << " ";
        return;
    }

    for(int i=k; i>=1; --i)
        cout << i << " ";
    if(k == n)return;
    root = build(k+1, n, k);
    vi restAns = BFS(root);
    for(auto e:restAns)
        cout << e << " ";
}

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