#include<bits/stdc++.h>

using namespace std;

ifstream f("farfurii.in");
ofstream g("farfurii.out");

int main(){
    int n;
    long long i,k,numarPermutariMaxim=1,numereDeAfisat,numarLimita;
    f>>n>>k;
    while(numarPermutariMaxim*(numarPermutariMaxim-1)/2<k){
        ++numarPermutariMaxim;
    }

    numereDeAfisat=n-numarPermutariMaxim;

    for(i=1;i<=numereDeAfisat;++i){
        g<<i<<" ";
    }

    numarLimita=n-(numarPermutariMaxim*(numarPermutariMaxim-1)/2-k);
    g<<numarLimita<<" ";

    for(i=n;i>=numereDeAfisat+1;--i){
        if(i!=numarLimita){
            g<<i<<" ";
        }
    }


    return 0;
}