#include <bits/stdc++.h>
#define ff first
#define ss second

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;

const string file = "farfurii";
const ll INF = 9223372036854775807ll;
const int inf = 2147483647, nmax = 100005;

int n, aint[nmax*4];
ll m;

void update(int nod, int st, int dr, int pos, int val)
{
    if(st == dr){
        aint[nod] += val;
    }else{
        int mid = (st+dr)/2;
        if(mid >= pos)
            update(nod*2, st, mid, pos, val);
        else update(nod*2+1, mid+1, dr, pos, val);
        aint[nod] = aint[nod*2]+aint[nod*2+1];
    }
}

int query(int nod, int st, int dr, int l, int r)
{
    if(st >= l && dr <= r)
        return aint[nod];
    int mid = (st+dr)/2, ans = 0;
    if(mid >= l)
        ans = query(nod*2, st, mid, l, r);
    if(mid+1 <= r)
        ans += query(nod*2+1, mid+1, dr, l, r);
    return ans;
}

int main()
{
    ifstream fin (file+".in");
    ofstream fout (file+".out");
    fin >> n >> m;
    for (int i = 1; i <= n; ++i){
        ll now = m-1ll*(n-i)*(n-i-1)/2+1;
        now = max(now, 1ll);
        m -= now-1;
        int st = 1, dr = n, mid, ans=-1;
        for (mid = (st+dr)/2; st <= dr; mid = (st+dr)/2)
            if(mid-query(1, 1, n, 1, mid) >= now){
                ans = mid;
                dr = mid-1;
            }else st = mid+1;
        update(1, 1, n, ans, 1);
        fout << ans << " ";
    }
    return 0;
}