#include <fstream>
#include <iostream>
#include <algorithm>
#include <set>
#include <queue>
#include <unordered_map>
#include <climits>

using namespace std;

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

const int LMAX = 50005;

int main() {
    long long n, k, i, x, poz;
    fin>>n>>k;
    i = 1;
    while (i <= n && (n - i)*(n - i + 1)/2 >= k) {
        i++;
    }
    x = k -(n - i)*(n - i + 1)/2;
    poz = i - 1;
    for (i = 1; i < poz; i++) fout<<i<<" ";
    fout<<i + x<<" ";
    x = poz + x;
    k = n;
    for (i = poz + 1; i <= n; i++) {
        if (k == x) k--;
        fout<<k<<" ";
        k--;
    }

    fin.close();
    fout.close();
    return 0;
}