#include<fstream>
#define inf "farfurii.in"
#define outf "farfurii.out"
#define NMax 100010
#define Dim 262144
#define LL long long
using namespace std;

fstream f(inf, ios::in), g(outf, ios::out);

int A[Dim], N; //A[n] - cate elemente mai avem in intervalul corespunzator nodului "n"
LL K;
int pos, val;
int answer;
int sol[NMax];

void update(int n, int left, int right) //pos, val - adds or removes the pos element
{
    if( left==right ) {
        A[n] += val;
        return;
    }

    int m = (left+right)/2;
    if( pos<=m ) update(2*n, left, m);
    else update(2*n+1, m+1, right);

    A[n] = A[2*n] + A[2*n+1];
}

void query(int n, int left, int right, int p) //get p'th element
{
    if( left==right ) {
        answer = left;
        return;
    }

    int m = (left+right)/2;
    if( p<=A[2*n] ) query(2*n, left, m, p);
    else query(2*n+1, m+1, right, p-A[2*n]);
}

inline LL max(LL x, LL y) { return ( x>y ? x : y ); }

int main()
{
    f>>N>>K;
    for(int i=1; i<=N; i++)
    {
        pos = i; val = 1;
        update(1,1,N);
    }

    LL contor_inversiuni = 0;
    for(int i=1; i<=N; i++) {
        LL t = N-i;
        LL inversiuni_ramase = (t-1)*t/2;
        //daca se pot face inca cel putin K inversiuni pun cel mai mic elem
        LL inversiuni_de_alcatuit = max(0, K - inversiuni_ramase - contor_inversiuni);
        contor_inversiuni += inversiuni_de_alcatuit;

        int p = inversiuni_de_alcatuit + 1;
        query(1,1,N,p);
        sol[i] = answer;
        pos = answer; val = -1;
        update(1,1,N);
    }

    for(int i=1; i<=N; i++) g<<sol[i]<<" ";

	f.close(); g.close();
	return 0;
}