#include <bits/stdc++.h>
using namespace std;
 
ifstream in("farfurii.in");
ofstream out("farfurii.out");
 
long long k,n;
int i,j,v[100010];
 
int main()
{
    in>>n>>k;
    for(i=n;i>=1;i--)
        if(((n-i)*(n-i+1))/2>=k)
            break;
    for(j=1;j<i;j++)
        v[j]=j;
    v[i]=k-((n-i)*(n-i-1))/2+i;
    for(j=i+1;j<=n;j++)
        if(n+i+1-j>v[i])
            v[j]=n+i+1-j;
        else
            v[j]=n+i-j;
    for(i=1;i<=n;i++)
        out<<v[i]<<' ';
    return 0;
}