#include <fstream>
#include <math.h>
using namespace std;


long long n, k;

int main(){
  ifstream in("farfurii.in");
  ofstream out("farfurii.out");
  in>>n>>k;
  in.close();
  long long inv;
  inv = (1 + sqrt(1 + 8*k)) / 2;
  if (2*k == inv* (inv-1)){
    for (long long i = 1; i<= n-inv; ++i)
      out<<i<<" ";
    for(long long i = 0; i<inv; ++i )
      out<<n-i<<" ";
  }else{
    long long m = inv*(inv+1)/2;
    for(long long i = 1; i<=n-inv-1;++i)
      out<<i<<" ";
      out<<n+k-m<<" ";
    for(long long i = 0; i<=inv;++i)
      if (i != m-k) out<<n-i<<" ";
  }
  out.close();


  return 0;


}