#include <bits/stdc++.h>
#define ll long long
#define NMAX 100001
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
int n;
ll k;
vector< int > sol;
int aint[NMAX*4];
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;
}
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 main()
{
    fin>>n>>k;
    for(int i=1;i<=n;++i)
    {
       ll acum = k - 1ll*(n-i)*(n-i-1)/2 +1;
       int mx = max(acum , 1ll);
       cout<<acum<<" ";
       k -= mx-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) >= mx){
                ans = mid;
                dr = mid-1;
            }
            else st = mid+1;
        update(1, 1, n, ans, 1);
        fout<< ans << " ";
    }
    return 0;
}