#include <fstream>
#include <algorithm>

using namespace std;

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

long long v[100001], i, j, n, k, nr, p = 1, x, aux, pr;

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

    nr = 0;
    while(nr < k) {
        nr += p;
        p++;
    }

    for(i = 1;i <= n - p;i++) {
        v[i] = i;
    }

    x = n;
    for(i = n - p + 1;i <= n;i++) {
        v[i] = x;
        --x;
    }

    x = n - p + 1 + (nr - k);

    for(i = x;i > n - p + 1;i--) {
        swap(v[i], v[i - 1]);
    }

    for(i = 1;i <= n;i++) {
        fout << v[i] << ' ';
    }

    fin.close();
    fout.close();

    return 0;
}