#include <fstream>
#include <algorithm>
#define ll long long
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");

int v[100002];
bool cmp(int a,int b)
{
    return a>b;
}

int main()
{
    ll n,m,s=0;
    fin>>n>>m;
    ll k=1;
    while(s<m)
    {
        s+=k;
        k++;
    }
    ll ramas=s-m-k+1;
    if(ramas<0)
        ramas*=-1;
    if(ramas)
    {
        int co=0;
        for(int i=1;i<=n-k+1;i++)
        {
            v[++co]=i;
        }
        for(int i=n;i>n-k+1;i--)
        {
            v[++co]=i;
        }
        int k1=n-ramas+1;
        k=n-k+1;
        int aux=v[k];
        v[k]=v[k1];
        v[k1]=aux;
        sort(v+k1,v+n+1,cmp);
        for(int i=1;i<=n;i++)
        {
            fout<<v[i]<<" ";
        }
    }
    else
    {
        for(int i=1;i<=n-k;i++)
        {
            fout<<i<<" ";
        }
        for(int i=n;i>=n-k+1;i--)
        {
            fout<<i<<" ";
        }
    }
    return 0;
}