#include <fstream>

using namespace std;

int n,K;

inline long long NrInv(int x)
{
    long long nr=n-x+1;
    return nr*(nr-1)/2;
}

int main()
{
    int i,j,val;
    ifstream fin("farfurii.in");
    fin>>n>>K;
    fin.close();

    ofstream fout("farfurii.out");
    i=1;
    //fout<<i<<" "<<n<<"\n";
    //fout<<K<<" "<<NrInv(2)<<"\n";
    while(i<=n && K<=NrInv(i+1))
    {
        fout<<i<<" ";
        i++;
    }

    if(i<=n)
    {
        val=i+(1LL*K-NrInv(i+1));
        fout<<val<<" ";
        for(j=n;j>=i;--j)
            if(j!=val)
                fout<<j<<" ";
    }
    fout<<"\n";
    return 0;
}