#include <bits/stdc++.h>
using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");

long long int N, K, cnt=1;

int main(){
    f >> N >> K;
    // cat timp K este mai mic decat numarul de inversiuni posibile
    while(K <= (N-cnt) * (N-cnt-1) / 2) {
        g << cnt << " ";
        cnt++;
    }
    long long int numar_permutari_plus = K - (N-cnt) * (N-cnt-1) / 2;
    long long int numar_permutat = cnt + numar_permutari_plus;
    g << numar_permutat << " ";
    for(int i = N; i >= cnt; i--)
        if(i != numar_permutat){
            g << i << " " ;
        }
}