#include <cstdio>
#include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <cstring>
#include <string>
#include <set>
#include <stack>
#include <unordered_map>
using namespace std;

long long N,S,K,i,j,aux;
int main()
{
    freopen("farfurii.in", "r", stdin);
    freopen("farfurii.out", "w", stdout);

    cin>>N>>K;

    for(i=1;i<=N;++i)
    {
        S = (N-i)*(N-i-1)/2;
        if(S >= K)
        {
            cout<<i<<" ";
            continue;
        }
        else
        {
            aux = K - S + i;
            cout<<aux<<" ";
            for(j=N;j>aux;--j)
                cout<<j<<" ";

            for(j=aux-1;j>=i;--j)
                cout<<j<<" ";
            return 0;
        }
    }
    return 0;
}