#include<fstream>
#include<iostream>
using  namespace std;

int n,k;

void citire() {

    ifstream in("farfurii.in");
    in>>n>>k;

}

void solve() {

    ofstream out("farfurii.out");
    long long  m=n,l;
    int i;

    while((m*(m-1)/2)>=k)
        m--;
    m++;
    for(i=1;i<=n-m;i++)
        out<<i<<" ";

    l=m*(m-1)/2-k;
    out<<n-l<<" ";

    for(i=n;i>n-m;i--){
        if(i!=n-l)
            out<<i<<" ";
    }

    out<<'\n';

}

int main () {

    citire();
    solve();
    return 0;
}