#include<stdio.h>
#define ll long long
using namespace std;
long long n,k,val,i,v[100001],l,max1,max2,s,s1,x,f,k1;
int main() 
{
	freopen("farfurii.in","r",stdin);
	freopen("farfurii.out","w",stdout);
	scanf("%lld%lld",&n,&k);
	for(i=1;i<=n;i++)
	{
		k1=(n-i)*((n-i)-1)/2;
		if(k1<k) 
		{
			printf("%lld ",k-k1+i);
			break;
		}
		//out<<i<< " ";
		printf("%lld ",i);
	}
	if(k1<k)
		val=k-k1+i;
	x=n-i+1;
	for(i=1;i<=x;i++)
	{
			if(l>max1)
				max1=l;
			else
				max1=v[i];
		l++;
	}
	for(i=0;i<x;i++) 
	{
		if(val!=n-i)
			printf("%lld ",n-i);
			//out<<n-i<<" ";
	}
	return 0;
}