#include <bits/stdc++.h>

using namespace std;

ifstream in("farfurii.in");
ofstream out("farfurii.out");
const int N = 1e5+5;
int v[N];

int main()
{
    long long n, k, j;
    in>>n>>k;
    long long i = 0;
    while (i*(i+1)/2<k)
        i++;
    i--;
    for(j = 1; j<=n; j++)
    {
        if(n-j-1>=i)
            v[j] = j;
        else
            v[2*n-i-j] = j;
    }
    long long r = k-(i+1)*i/2;
    j = n;
    long long poz = n-i-1;
    while(r--)
    {
        swap(v[j],v[poz]);
        j--;
    }
    for(i = 1; i<=n; i++)
        out << v[i] << " ";
    return 0;
}