#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(),c.end()
#define mp(x,y) make_pair(x,y)
#define mem(a,val) memset(a,val,sizeof(a))
#define eb emplace_back
#define f first
#define s second
#define pb push_back
#define pp pop_back

using namespace std;
bool srt(const pair<pair<int,int>,int> &a,const pair<pair<int,int>,int> &b)
{
	if(a.first.first<b.first.first)
	return true;
	else if(a.first.first==b.first.first)
	return a.first.second>b.first.second;
	else
	return false;
}
void solve()
{
	int n;cin>>n;
	vector<pair<pair<int,int>,int>>v;
	for(int i=0;i<n;i++)
	{
		int a,b;cin>>a>>b;
		v.push_back({{b,a},i});
		v.push_back({{a,b},i});
	}
	sort(v.begin(),v.end(),srt);

  vector<pair<pair<int,int>,int>>dp(2*n);
  dp[0]=v[0];
  for(int i=1;i<2*n;i++)
  {
    if(v[i-1].first.first != v[i].first.first)
    {
      if(dp[i-1].first.second<v[i-1].first.second)
			dp[i]=dp[i-1];
			else
			dp[i]=v[i-1];
    }
    else
    dp[i]=dp[i-1];
  }

  // cout<<endl;
	// for(int i=0;i<2*n;i++)cout<<v[i].first.first<<"-"<<v[i].first.second<<" "<<dp[i].first.first<<"-"<<dp[i].first.second<<endl;
	// cout<<endl;
	int ans[n];
	for(int i=0;i<n;i++)ans[i]=-2;
	for(int i=0;i<2*n;i++)
  {
    if(v[i].first.first>dp[i].first.first && v[i].first.second>dp[i].first.second)
    ans[v[i].second]=dp[i].second;
  }

	for(int i=0;i<n;i++)cout<<ans[i]+1<<" ";
	cout<<endl;
}

int main()
{
  std::ios::sync_with_stdio(false);
  int T=1;
  cin>>T;
  // cin.ignore(); must be there when using getline(cin, s)
  while(T--)
  {
    solve();
  }


  return 0;
}
