#include <fstream>
const int MAX_N = 100000;

using namespace std;

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

long long n, k;

int main() {
    fin >> n >> k;
    long long p = 1 << 17, i = 0;
    while(p > 0) {
        int j = i + p;
        if((j <= n) && (1LL*(n - j) * (n - j + 1) / 2 >= k))
            i += p;
        p >>= 1;
    }
    long long j = n - i + 1;
    long long x = k - 1LL*(j - 1) * (j - 2) / 2;
    for(p = 1; p < i; p++)
        fout << p << " ";
    fout << i + x << " ";
    for(p = n; p >= i; p--)
        if(p != (i + x))
        fout << p << " ";
    return 0;
}