#include<bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
 
#define F first
#define S second
 
const int MOD = 1e9 + 7;//XXX
const int C = 26;//XXX
 
void add(int &x, int y){
	x += y;
	while (x >= MOD) x -= MOD;
	while (x < 0) x += MOD;
}
 
int fix(int x){
	while (x >= MOD) x -= MOD;
	while (x < 0) x += MOD;
	return x;
}
 
int pw(int a, int b){
	int ret = 1;
	while (b){
		if (b & 1)
			ret = 1ll*ret*a%MOD;
		b >>= 1;
		a = 1ll*a*a%MOD;
	}
	return ret;
}
 
const int MAXN = 2e5 + 10;

int n, h[MAXN], w[MAXN], ans[MAXN], vec[2*MAXN], sz, sec[MAXN], ord[MAXN];
pii pre[MAXN];

void solve() {
	sz = 0;
	cin >> n;
	for(int i = 0; i < n; i++) {
		cin >> h[i] >> w[i];
		vec[sz++] = h[i];
		vec[sz++] = w[i];
	}
	//sort(vec, vec+sz);
	//sz = unique(vec, vec+sz) - vec;
	//for(int i = 0; i < n; i++) {
		//h[i] = lower_bound(vec, vec+sz, h[i]) - vec;
		//w[i] = lower_bound(vec, vec+sz, w[i]) - vec;
	//}
	memset(ans, -1, 4*n);
	iota(sec, sec+n, 0);
	sort(sec, sec+n, [](int i, int j) {
		return w[i] < w[j];
	});
	set<pii> s;
	for(int i = 0, j = 0; i < n; i = j) {
		while(j < n && w[sec[i]] == w[sec[j]])
			j++;
		
		for(int k = i; k < j; k++) {
			auto it = s.lower_bound(make_pair(h[sec[k]], -1));
			if(s.empty())
				continue;
			if(it == s.begin())
				continue;
			--it;
			ans[sec[k]] = max(ans[sec[k]], it->second);
		}
		
		for(int k = i; k < j; k++) {
			s.emplace(h[sec[k]], sec[k]+1);
		}
	}
	
	iota(ord, ord+n, 0);
	sort(ord, ord+n, [](int i, int j) {
		return h[i] < h[j];
	});
	
	for(int i = 0; i < n; i++) {
		pre[i] = make_pair(w[ord[i]], ord[i]+1);
		if(i) {
			pre[i] = min(pre[i], pre[i-1]);
		}
	}
	
	for(int i = 0, j = 0; i < n; i++) {
		while(j < n && h[ord[j]] < w[sec[i]])
			j++;
		if(j) {
			pii best = pre[j-1];
			if(best.F < h[sec[i]])
				ans[sec[i]] = max(ans[sec[i]], best.S);
		}
	}
	
	for(int i = 0; i < n; i++) {
		cout << ans[i] << " ";
	}
	cout << "\n";
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//cout << fixed << setprecision(6);
	
	int te = 1;	
	cin >> te;
	for (int ww = 1; ww <= te; ww++){
		//cout << "Case #" << w << ": ";
		solve();
	}
	return 0;
}
