#include <fstream>
#include <cmath>
#define MAXN 100001
using namespace std;

int main() {
    long long N, K;
    ifstream in("farfurii.in");
    in >> N >> K;
    in.close();

    int v[MAXN];
    double p = (sqrt(1 + 8*K) - 1) / 2;
    long long pos = p;
    if (p != (long long)p) {
			++pos;
    }
    pos = N - pos;

    for (long long i = 1; i < pos; ++i) {
			v[i] = i;
    }
    long long val = N;
    for (long long i = pos; i <= N; ++i) {
			v[i] = val--;
    }

    long long inversiuni = 1LL * (N - pos) * (N - pos + 1) / 2;
    while (inversiuni > K) {
        //schimb numarul de pe pos cu primul numar mai mic ca el
        for (long long j = pos + 1; j <= N; ++j) {
            if (v[j] < v[pos]) {
                swap(v[j], v[pos]);
                break;
            }
        }
        --inversiuni;
    }

    ofstream out("farfurii.out");
    for (long long i = 1; i <= N; ++i) {
        out << v[i] << " ";
    }
    out.close();

    return 0;
}