#include<bits/stdc++.h>
#define maxN 100005
using namespace std;
int n,v[maxN],x,y;
long long k,m;
int main()
{
    freopen("farfurii.in","r",stdin);
    freopen("farfurii.out","w",stdout);
    scanf("%d%lld",&n,&k);
    for(int i=1;i<=n;i++) v[i]=i;
    m=1LL;
    while((m*(m-1LL)>>1LL)<k) m+=1LL;
    reverse(v+(n-m)+1,v+n+1);
    x=(m*(m-1)>>1)-k;
    if(x)
    {
        y=v[n-m+1+x];
        for(int j=n-m+x;j>=(n-m+1);j--)
        {
            v[j+1]=v[j];
        }
        v[n-m+1]=y;
    }
    for(int i=1;i<=n;i++) printf("%d ",v[i]);
    printf("\n");
    return 0;
}