#include <cstdio>
#include <algorithm>

#define LL long long

using namespace std;

int N; LL K;

void Solve ()
{
    freopen ("farfurii.out", "w", stdout);
    LL P;
    for (P=1; P*(P-1)/2<=K; ++P); --P;
    K-=(P*(P-1)/2);
    P=N-P;
    for (int i=1; i<P; ++i) printf ("%d ", i);
    int X=N;
    for (int i=max (1LL, P); i<=N; ++i)
    {
        if (i==P+K) printf ("%d ", P);
        else printf ("%d ", X--);
    }
}

void Read ()
{
    freopen ("farfurii.in", "r", stdin);
    scanf ("%d %lld", &N, &K);
}

int main ()
{
    Read ();
    Solve ();
    return 0;
}