//
// Created by Octavian Farcasi on 28.05.2023.
//

#include<iostream>
#include<fstream>
int main(){
    std::ifstream f("farfurii.in");
    std::ofstream g("farfurii.out");

    long long int n,m,nr_total,copie;

    f>>n>>m;
    copie=n;

    nr_total=(n-1)*n/2;

    if(nr_total==m){
        for(long long int i=n;i>=1;i--)
            g<<i<<" ";
    }
    else{
        while((copie-2)*(copie-1)/2>m && copie>2)
            copie--;
        long long int indice=(copie-1)*copie/2-m+1;
        for(int i=1;i<=n-copie;i++)
            g<<i<<" ";
        g<<n-indice+1<<" ";
        long long int cnt=1;
        for(long long int i=n;i>n-copie;i--){
            if(cnt!=indice)
                g<<i<<" ";
            cnt++;
        }
    }

    f.close();
    g.close();

    return 0;
}