#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <vector>
#include <climits>
#include <stack>

using namespace std;

ifstream f("farfurii.in");
ofstream g("farfurii.out");

int main()
{
    long long n, k, p = 0, d;
    f >> n >> k;
    while (p*(p+1)/2 < k)
    {
        p++;
    }
    for (long long i = 1; i < n - p; i++)
    {
        g << i << " ";
    }
    d = p * (p + 1) / 2 - k;
    g << n - d << " ";
    d = n - d;
    for (long long i = n; i >= n - p; i--)
    {
        if (i != d)
            g << i << " ";
    }
    return 0;
}