#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int n, k ;
	
int main()
{
	
	freopen("farfurii.in", "r", stdin);
	freopen("farfurii.out", "w", stdout);

	scanf("%d%d", &n, &k);
	
	int suma = 0 ;
	int start ;
	
	for(int i = 1; i <= n; ++i )
	{
		suma += i ;
		if( suma >= k ) 
		{
			start = i ; 
			break ;
		}
	}
	
	long long rest = (long long) ( ( ( start + 1 ) * start ) / 2 - k ) ;
 
	for(int i = 1; i <= n - 1 - start; ++i )
		printf("%d ", i);
	
	long long nu = (long long) ( n - rest ) ;
	
	printf("%lld ", nu);

	for(int i = n; i >= n - start; --i )
		if( i != nu )
			printf("%d ", i);
 
	return 0 ;    

}