#include <bits/stdc++.h>

typedef long double ld;
typedef long long ll;
using namespace std;
int di[] = {1, 0, -1, 0, 0, 1, -1, 1};
int dj[] = {0, 1, 0, -1, -1, 0, 1, -1};

const ll oo = 1e18;
const int N = 2e5 + 5, M = 1e5 + 5, MOD = 998244353;
#define EPS 1e-9

int n, m, sz[N], id, ord[N];
vector<int> v[N];

int dfs(int node, int lvl) {
    sz[node] = 1;
    while (v[node].size() < 2 && lvl < m && id < n) {
        v[node].push_back(++id);
        sz[node] += dfs(id, lvl + 1);
    }
    return sz[node];
}

void dfs2(int node, int par, int isright) {
    if (isright) ord[node] = par + 1 + (v[node].size() >= 1 ? sz[v[node][0]] : 0);
    else ord[node] = par - 1 - (v[node].size() >= 2 ? sz[v[node][1]] : 0);
    for (int i = 0; i < v[node].size(); i++) dfs2(v[node][i], ord[node], i);
}

int main() {
    //  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> n >> m;
    id = 1;
    int mn = 0;
    int tmp = n;
    while (tmp) tmp >>= 1, mn++;
    if (m < mn) return !(cout << "impossible");
    dfs(1, 1);
//    for (int i = 1; i <= n; i++) {
//        for (auto x:v[i]) cout << x << " ";
//        cout << endl;
//    }
//    for (int i = 1; i <= n; i++) cout << sz[i] << " ";
//    cout << endl;
    dfs2(1, 0, 1);
    for (int i = 1; i <= n; i++) cout << ord[i] << " ";
    return 0;
}