#include<fstream>
using namespace std;
ifstream fi("farfurii.in");
ofstream fo("farfurii.out");

long long aux,m=1;
long long i,n,k;

int main(){
    fi>>n>>k;
    //calculam numarul minim de inversiuni >= decat k
    while((m*(m-1)/2)<k) m++;
    
    //afisam elementele neinversate
    for(i=1;i<=n-m;i++) fo<<i<<" ";
    
    //scadem numarul de inversiuni la k
    aux=n-((m*(m-1)/2)-k);
    fo<<aux<<" ";
    
    //afisam elementele inversate
    for(i=n;i>n-m;i--)
      if(aux!=i) fo<<i<<" ";
    
    fi.close();
    fo.close();
    return 0;
}