#include <iostream>
#include <fstream>

using namespace std;

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

const int N = 100005;
long long n, k, v[N];

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