#pragma GCC optimize("O3", "fast-math", "unroll-loops", "no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#if !defined(ONLINE_JUDGE) and !defined(EVAL)
#include "template/debug.h"
#else
#define d(x...)
#endif
#define fr first
#define er erase
#define in insert
#define sc second
#define ll long long
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define len(x) (ll) x.size()
#define all(x) x.begin(),x.end()
const ll INF = 1e9, INFL = 1e18;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll maxn = 2e5 + 5;
ll n, m, k = 0;
ll f[maxn];
std::vector<int> construct_permutation(long long _k)
{
m = _k;
f[1] = 1;
n = 1;
for(ll i = 2; ; i ++){
f[i] = f[i - 1] + i;
if(f[i] > INFL) break;
n = i;
}
vll v;
m --; // bos coxluq
while(m){
ll l = 1, r = n, cv;
while(l <= r){
ll md = (l + r) >> 1;
if(f[md] <= m){
cv = md, l = md + 1;
}
else{
r = md - 1;
}
}
v.pb(cv);
m -= f[cv];
}
vector<int>cv;
for(auto i : v){
for(ll j = m - i + 1; j <= m; j ++){
// cout << j << ' ';
cv.pb(j);
}
m -= i;
}
return cv;
}
// void _() {
// }
// signed main() {
// ll tm = clock();
// cin.tie(0)->sync_with_stdio(0);
// ll t = 1;
// cin >> t;
// for(ll tt = 1; tt <= t; tt ++) _();
// cerr << "\n\033[1;31mTime: \033[1;30m" \
// << (double)(clock()-tm)/1000000 << "\033[1;32m seconds\n";
// }
