#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    int N, A, l, r, d, idx, idx2, l2, r2;
    cin >> N >> A;
    //最近接距離, -(添字), (左、右)
    priority_queue<tuple<int, int, int, int>> que;
    vector<int> ans(N+1);
    ans[A] = 1;
    if (A != 1) que.push({A-1, -1, 0, A-1});
    if (A != N) que.push({N-A, -N, N-A, 0});

    for (int i=2; i<=N; i++){
        tie(d, idx, l, r) = que.top(); que.pop();
        idx *= -1;
        ans[idx] = i;
        if (l >= 1){
            l2 = l/2;
            r2 = l-l2;
            idx2 = idx-r2;
            que.push({min(l2, r2), -idx2, l2, r2});
        }
        if (r >= 1){
            l2 = r/2;
            r2 = r-l2;
            idx2 = idx+l2;
            que.push({min(l2, r2), -idx2, l2, r2});
        }
    }

    for (int i=1; i<=N; i++) cout << ans[i] << " ";
    cout << endl;

    return 0;
}