#include<fstream>
#include<vector>

#define NMAX 100005

using namespace std;

ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n,k,diff;
vector<int> sol;
long long ccount;

void Solve ( void )
{

    while ( ccount*(ccount-1) /2 < k)
        ++ccount;
    diff=ccount*(ccount-1)/2-k;
    for(int i(n) ; i > n-ccount ; --i )
        sol.push_back(i);

}
void Write ( void )
{
    for(int i (1) ;i <= n- ccount ; ++i )
       g<<i<<" ";

    long long  value=sol[diff];
    g<<value<<" ";
    for(vector<int>::iterator it=sol.begin() ; it != sol.end() ; ++it )
        if( *it != value )
        g<<*it<<" ";
    g.close();
}

int main ( void )
{
    f>>n>>k;
    f.close();
    Solve();
    Write();
    return 0;
}