#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <functional>
#include <string>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <iomanip>
#define NMAX 100005
#define INF 0x3f3f3f3f
#define pb push_back

using namespace std;

typedef pair<int, int> pii;

ifstream fin("farfurii.in");
ofstream fout("farfurii.out");

vector<int> v[NMAX],jeg1,jeg2;
int viz[NMAX],vizitate,ok=1;

int main() {
	int n,i,k,x,lim,ramas,nr;

	fin>>n>>k;

	lim=1;
	while((lim+1)*lim/2<=k) ++lim;
	ramas=lim*(lim+1)/2-k;

	for(i=1;i<n-lim;++i) fout<<i<<' ';

	fout<<n-ramas<<' ';
	++i;
	for(nr=n;i<=n;++i) {
		if(nr==n-ramas) --nr;
		fout<<nr<<' ';
		--nr;
	}

	return 0;
}