#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define fi first
#define se second
#define pp push_back
#define all(x) (x).begin(), (x).end()
#define Ones(n) __builtin_popcount(n)
#define endl '\n'
#define mem(arrr, xx) memset(arrr,xx,sizeof arrr)
//#define int long long
#define debug(x) cout << (#x) << " = " << x << endl

void Gamal() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#ifdef Clion
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

int dx[] = {+0, +0, -1, +1, +1, +1, -1, -1};
int dy[] = {-1, +1, +0, +0, +1, -1, +1, -1};

const double EPS = 1e-9;
const ll OO = 0X3F3F3F3F3F3F3F3F;
const int N = 2e5 + 5, INF = INT_MAX, MOD = 1e9 + 7, LOG = 20;

void slv(int l, int r) {
    if (l > r)return;
    int mid = (l + r) / 2;
    cout << mid << ' ';
    slv(l, mid - 1);
    slv(mid + 1, r);
}

void calc(int l, int r, int k) {
    if (l > r)return;
    int sz = r - l + 1;
    if (k == sz) {
        cout << l << ' ';
        calc(l + 1, r, k - 1);
        return;
    }
    int last = 0;
    for (int i = 1; i <= sz; ++i) {
        if (__lg(i) + 1 + (sz - i) >= k) {
            last = i;
        }
    }
    slv(l, last + l - 1);
    k -= __lg(last) + 1;
    calc(l + last, r, k);
}

void solve() {
    int n, k;
    cin >> n >> k;
    int l = __lg(n) + 1;
    if (k < l) {
        cout << "impossible";
        return;
    }
    calc(1, n, k);
}


signed main() {
    Gamal();
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}