#include <cstdio>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <cmath>
int n,q;
int a[150001],aux;
int main()
{ FILE *f,*g;
    f=fopen("farfurii.in","r");
    g=fopen("farfurii.out","w");
   fscanf(f,"%d %d",&n,&q);
   int i,k;
   for(i=1;i<=n;i++)
    a[i]=i;
    for(k=1;k<=n;k++)
    if(k*(k-1)/2>=q) break;
    if(k*(k-1)/2==q) {
       // reverse(a+n-k+1,a+n);
        for(i=n-k+1;i<=(n+n-k+1)/2;i++)
         {aux=a[i];
         a[i]=a[n-(i-(n-k+1))];
         a[n-(i-(n-k+1))]=aux;}
    for(i=1;i<=n;i++)
     fprintf(g,"%d ",a[i]);
    }
    else
    {//reverse(a+n-k+1,a+n);
        for(i=n-k+1;i<=(n+n-k+1)/2;i++)
         {aux=a[i];
         a[i]=a[n-(i-(n-k+1))];
         a[n-(i-(n-k+1))]=aux;}
      //swap(a[n-k+1],a[n-k+1+k*(k-1)/2-q]);
         aux=a[n-k+1];
         a[n-k+1]=a[n-k+1+k*(k-1)/2-q];
         a[n-k+1+k*(k-1)/2-q]=aux;
    for(i=1;i<=n;i++)
     fprintf(g,"%d ",a[i]);
    }
    return 0;
}