#include <bits/stdc++.h>

//#pragma GCC optimize("Ofast")

using namespace std;

ifstream fin("farfurii.in");
ofstream fout("farfurii.out");

int ans[100001];

int main()
{   long long n, k, level, i, j, temp;
    fin>>n>>k;
    fin.close();
    level=(2+sqrt(1+k*8))/2;
    for (i=1;i<=n-level;++i)
        ans[i]=i;
    for (j=n;j>n-level;--j, ++i)
        ans[j]=i;
    temp=ans[n-level+1+level*(level-1)/2-k];
    for (i=n-level+1+level*(level-1)/2-k;i>n-level+1;--i)
        ans[i]=ans[i-1];
    ans[n-level+1]=temp;
    for (i=1;i<=n;++i)
        fout<<ans[i]<<' ';
    fout.close();

    return 0;
}