# include<bits/stdc++.h>

using namespace std;
# define l long long 
# define db double 
# define rep(i,a,b) for(l i=a;i<b;i++)
# define vi vector<l>
# define vvi vector<vi>
# define vsi vector<set<l> >
# define pb push_back
# define mp make_pair
# define ss second
# define ff first
# define pii pair<l,l>
# define trvi(v,it) for(vi::iterator it=v.begin();it!=v.end();++it)
# define read(a) freopen(a,"r",stdin)
# define write(a) freopen(a,"w",stdout)
# define io ios::sync_with_stdio(false)

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ' ' << p.second << ')'; }

const bool MULTIPLE_TEST_CASES = true;

const l MOD=1e9+7;
const l N=2e5+5;
const l INF=1e12;


vector<pair<pii,l>> people(2*N);

void solve() {
	l n;
	cin>>n;
	people.resize(2*n);

	rep(i,0,n) {
		l h, w;
		cin>>h>>w;
		people[2*i] = mp(mp(h,w),i+1);
		people[2*i+1] = mp(mp(w,h),i+1);
	}
	map<l,l> m;

	sort(people.begin(), people.end());

	// m[0]=0;
	vi match(n,-1);


	l bestH = INF;
	l bestIdx = -1;

	l bestCur = INF;
	l bestCurIdx = -1;
	
	rep(i,0,2*n) {
		if(i==0 || people[i].ff.ff != people[i-1].ff.ff) {
			if(bestCur<bestH) {
				bestH = bestCur;
				bestIdx = bestCurIdx;
				bestCur = INF;
				bestCurIdx = -1;
			}
		}
		// cout<<"bestHeight "<<bestH<<" "<<bestIdx<<"\n";
		l val = people[i].ss;
		l height = people[i].ff.ss;
		if(height>bestH) {
			match[val-1] = bestIdx;
		}

		if(height<bestCur) {
			bestCur = height;
			bestCurIdx = val;
		}
	}

	rep(i,0,n) {
		cout<<match[i]<<" ";
	}
	cout<<"\n";


	return;
}


int main(){
	io;
	int t=1;
	if (MULTIPLE_TEST_CASES) cin>>t;
	rep(i,0,t) {
		solve();
	}

	return 0;
}
