#include<fstream>
#include<algorithm>
using namespace std;
long long n,k,x,y,i,p;
int main()
{
    ifstream f("farfurii.in");
    ofstream g("farfurii.out");
f>>n>>k;
while(p*(p+1)<=2*k)
    p++;
p--;
x=p*(p+1)/2;
for(i=1;i<=n-p-2;i++)
    g<<i<<" ";
y=k-x;
y=n-p-1+y;
g<<y<<" ";
for(i=n;i>=n-p-1;i--)
    if(i!=y)
        g<<i<<" ";
return 0;
}