#include <cstdio>
using namespace std;
FILE *fin = fopen("farfurii.in", "r");FILE *fout = fopen("farfurii.out","w");long long N, M, i, j, K, ok, minim, T, X, Y, Z;void CodeExpert(){fscanf(fin, "%ld%ld", &N, &K); X = 1;while((X+1) * 1LL * (X+2) <= K * 2)X ++;Y = X * 1LL * (X+1) / 2;for(i = 1; i <= N-X-2; i ++)       /*V[++T] = i;*/fprintf(fout,"%ld ", i);Z = K-Y; Z = N-X-1+Z; fprintf(fout,"%ld ", Z);for(i = N; i >= N-X-1; i --)if(i == Z)                    continue;else                          fprintf(fout,"%ld ", i);/*for(i = 1; i <= N; i ++) /*fout << V[i] << " ";*//*fprintf(fout,"%d ", V[i]);*/return;}int main(){CodeExpert();return 0;}