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

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

int main() {
    long long n, k;
    fin >> n >> k;
    k = (n - 1) * n / 2 - k;
    int a[100001];
    for (int i = 1; i <= n; ++i) {
        a[i] = n - i + 1;
    }
    for (int i = 1; i < n && k > 0; ++i) {
        for (int j = i + 1; j <= n && k > 0; ++j) {
            swap(a[i], a[j]);
            --k;
        }
    }
    for (int i = 1; i <= n; ++i) {
        fout << a[i] << ' ';
    }
    return 0;
}