#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

const int NMAX=1e5+5;
int v[NMAX];

int main()
{
    long long n,k,i,j,poz=0,kon=0;
    fin>>n>>k;
    while(kon<k)
    {
        poz++;
        kon=(poz+1)*poz/2;
    }
    for(i=1;i<=n-poz-1;i++)
        fout<<i<<" ";
    fout<<n+k-kon<<" ";
    for(i=n;i>=n-poz;i--)
    {
        if(i==n+k-kon)
          continue;
        fout<<i<<" ";
    }
    return 0;
}