#include <bits/stdc++.h>
using namespace std;
ifstream fi("farfurii.in");
ofstream fo("farfurii.out");

typedef long long ll;
const int NMAX = 1e5 + 5;

ll n, k;

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

    ll m = 1;
    while (1LL * m * (m - 1) / 2 < k)
        m++;

    ll x = (n - m + 1) + k - (m - 1) * (m - 2) / 2;
    for (int i = 1; i <= n - m; i++)
        fo << i << " ";
    fo << x << " ";
    for (int i = n; i > n - m; i--)
        if (i != x)
            fo << i << " ";

    return 0;
}