#include <bits/stdc++.h>

using namespace std;
ifstream f("farfurii.in");
ofstream g("farfurii.out");
long long n, k, maxim, i, rez, init_n;

int main()
{
  f>>n>>k, init_n = n, --n;
  maxim = n * (n + 1) / 2;
  for(i = 1;maxim - n >= k;++i)
    g<<i<<" ", maxim -= n, --n; 
  g<<i + k - maxim + n<<" ";
  for(int j = init_n;j >= i;--j)
    if(j != i + k - maxim + n)
      g<<j<<" ";
  return 0;
}