#include <cstdio>
#include <algorithm>

#define LL long long

using namespace std;

int N; LL K;

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

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

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