#include "bits/stdc++.h"	/** keep-include */
using namespace std;

#define per(i, b, e) for(int i = (e); i >= (b); i--)
#define FOR(i, b, e) rep(i, b, (e) - 1)
#define SZ(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;

auto &operator<<(auto &o, pair<auto, auto> p) {
	return o << "(" << p.st << ", " << p.nd << ")"; }
auto operator<<(auto &o, auto x)->decltype(end(x), o) {
	o << "{"; int i=0; for(auto e: x) o << ", " + 2*!i++ << e;
	return o << "}"; }
#ifdef LOCAL
#define deb(x...) cerr << "[" #x "]: ", [](auto...$) { \
	((cerr << $ << "; "),...) << endl; }(x)
#else
#define deb(...)
#endif

#include "ds.h"

mt19937 rng(1235432);

vector<pii> changed;
void change(int x, int y){
	//deb("change: ", x, y);
	exchange(x, y);
	changed.pb(mp(x, y));
}

int ask(int v){
	int t=query(v);
	//deb("query:",v, t);
	return t;
}

int tidy_path(int v, int start, int q_val){
	for(int i=start; ;i++){
		int t=q_val;
		if(i!=start)t=ask(v);
		if(t<=i || t<start)return t;
		change(t, i);
	}
}
//sortuje wierzcholki sciezki i ustawia ich krawedzi w dobrej kolejnosci
vector<int> sort_on_path(vector<int> V, int start, int end){//ostatni w V jest ostatnim na sciezce
	if(V.size()==1){
		return V;
	}
	int v=V[rng()%(V.size()-1)];
	int mid=tidy_path(v, start, ask(v))+1;
	vector<int> L, R;
	for(int i:V){
		if(i==v)continue;
		else if(i==V.back())R.pb(i);
		else{
			int d=ask(i);
			if(d<mid)L.pb(i);
			else R.pb(i);
		}
	}
	deb(v, L, R);
	L.pb(v);
	L=sort_on_path(L, start, mid);
	R=sort_on_path(R, mid, end);
	for(int i:R)L.pb(i);
	return L;
}
vector<int> sort_on_path2(vector<int> V, int start, int end){//ostatni w V jest ostatnim na sciezce
	if(V.size()==1){
		return V;
	}
	shuffle(V.begin(), V.end()-1, rng);
	set<int> S;
	S.insert(start);
	vector<int> ans(V.size());
	ans.back()=V.back();
	for(int v:V){
		if(v==V.back())break;
		int t=ask(v);
		int u=*(--S.upper_bound(t));
		deb(v, u, t);
		int ord=tidy_path(v, u, t);
		ans[ord-start]=v;
		S.insert(ord+1);
	}
	deb(V);
	deb(ans);
	return ans;
}

void solve(int n, int lim1, int lim2) {
	for(int i=2; i<n; i++){
		int t=rng()%(i-1);
		if(t)change(i, t);
	}
	int wsk=1;
	vector<int> beg;
	vector<int> rep;
	vector<vector<int> > who;
	for(int i=2; i<=n; i++){
		int t=tidy_path(i, wsk, ask(i));
		if(t<wsk){
			int k=lower_bound(all(beg), t)-beg.begin();
			who[k].pb(i);
		}
		else{
			wsk=t+1;
			beg.pb(t);
			rep.pb(i);
			who.pb({i});
		}
	}
	deb(beg, rep, who);
	vector<int> kol;
	std::vector<int> par(n+1), val(n+1);
	for(int i=0; i<beg.size(); i++){
		reverse(all(who[i]));
		who[i]=sort_on_path2(who[i], beg[i]+1-who[i].size(), beg[i]+1);
		for(int j:who[i]){
			kol.pb(j);
		}
		for(int j=1; j<who[i].size(); j++){
			par[who[i][j]]=who[i][j-1];
		}
	}
	deb(kol);
	vector<int> whose_edge(n);
	whose_edge[1]=1;
	for(int i=0; i<kol.size(); i++){
		int v=kol[i];
		whose_edge[i+1]=v;
		if(i){
			swap(whose_edge[1], whose_edge[i+1]);
			change(1, i+1);
		}
		if(!par[v]){
			
			int t=ask(v);
			par[v]=whose_edge[t];
			if(t==1)par[v]=1;
		}
	}
	deb(whose_edge);
	deb(kol);
	while(changed.size()){
		swap(whose_edge[changed.back().st], whose_edge[changed.back().nd]);
		changed.pop_back();
	}
	for(int i=1; i<n; i++){
		val[whose_edge[i]]=i;
	}
	deb(par, val);
	reverse(all(par));
	par.pop_back();
	par.pop_back();
	reverse(all(par));
	reverse(all(val));
	val.pop_back();
	val.pop_back();
	reverse(all(val));
	answer(par, val);
}