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

ifstream fin("farfurii.in");
ofstream fout("farfurii.out");

bool used[100005];
int n, k;

void solve() {
    for(int i = 1; i <= n; i++) {
        long long inv = 1LL*(n-i)*(n-i-1)/2;
        long long smaller = 0;
        for(int j = 1; j <= n; j++)
            if(!used[j]) {
                if(smaller+inv >= k) {
                    used[j] = true;
                    fout << j << ' ';
                    k -= smaller;
                    break;
                }
                smaller++;
            }
    }
}

int main() {
    fin >> n >> k;
    solve();
}