#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <fstream>
#include <algorithm>
#include <vector>
#include <climits>
std::ifstream in("../farfurii.in");
std::ofstream out("../farfurii.out");


int main() {
    long long n,k,i;
    in>>n>>k;
    for(i = n; i>1&&k>n-i; i--)
        k-=(n-i);
    for(long long  j = 1; j<i; j++)
        out<<j<<' ';
    long long f_scos = i+k;
    out<<f_scos<<' ';
    for(long long j = n; j>= i; j--)
        if(j!=f_scos)
            out<<j<<' ';
    return 0;
}