#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = (1<<29);
const int INFF = 0x7fffffff;
const ll LINF = (1ll<<60);
const ll LINFF = 0x7fffffffffffffff;
const long double PI = 3.14159265359;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll a, ll b){return uniform_int_distribution<ll>(a, b)(rng);}
#define _fi(n) for(int i = 0;i < n;i++)
#define _fj(n) for(int j = 0;j < n;j++)
#define _fk(n) for(int k = 0;k < n;k++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define prec(x) cout << fixed << setprecision(x)
#define sz(x) (int)x.size()
#define _log2(x) 31-__builtin_clz(x)
#define hash sodnf9843bsd
#define right iadjfof23n3okd
#define pqueue priority_queues
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define endl '\n'

const int maxn = 5e5+111;

struct node{
    node *l, *r;
    int sum;

    node(int x){
        l = nullptr;
        r = nullptr;
        sum = x;
    }
    node(node* left, node* right){
        l = left;
        r = right;
        sum = 0;
        if (l != nullptr) sum = max(sum, l->sum);
        if (r != nullptr) sum = max(sum, r->sum);
    }
};

node *ver[maxn];

int query(node *seg, int l, int r, int tl = 0, int tr = maxn){
    if (l > r || seg == nullptr) return 0;
    if (tl == l && tr == r) return seg->sum;
    int mid = (tl+tr)/2;
    return  max(query(seg->l, l, min(r, mid), tl, mid),
            query(seg->r, max(l, mid+1), r, mid+1, tr));
}

node *update(node *seg, int i, int x, int tl = 0, int tr = maxn){
    if (tl == tr) return new node(x);
    if (seg == nullptr) seg = new node(0);
    int mid = (tl+tr)/2;
    if (i <= mid) return new node(update(seg->l, i, x, tl, mid), seg->r);
    else return new node(seg->l, update(seg->r, i, x, mid+1, tr));
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t;cin>>t;
    while(t--){
        int n;cin>>n;
        vector<pair<int, int>>v;
        vector<int>compress;
        _fi(n){
            int a, b;cin>>a>>b;
            v.pb({a, b});
            compress.pb(a);
            compress.pb(b);
        }
        sort(all(compress));
        compress.resize(unique(all(compress))-compress.begin());

        vector<tuple<int, int, int>>vcomp;
        for(int i = 0;i < n;i++){
            int a = v[i].first;
            int b = v[i].second;
            a = 1+lower_bound(all(compress), a)-compress.begin();
            b = 1+lower_bound(all(compress), b)-compress.begin();
            v[i] = {a, b};
            vcomp.pb({a, b, i+1});
        }

        sort(all(vcomp), [](const tuple<int, int, int>&a, const tuple<int, int, int>&b){
            if (get<0>(a) == get<0>(b)) return get<1>(a) > get<1>(b);
            return get<0>(a) < get<0>(b);
        });

        for(int i = 0;i < 2*n+111;i++) ver[i] = nullptr;

        node *last = ver[0];
        for(auto &tp:vcomp){
            int a, b, i;
            tie(a, b, i) = tp;
            ver[a] = update(last, b, i);
            last = ver[a];
        }

        for(int i = 1;i < 2*n+111;i++){
            if (ver[i] == nullptr) ver[i] = ver[i-1];
        }

        for(int i = 0;i < n;i++){
            int a = v[i].first;
            int b = v[i].second;

            int j = max(query(ver[a-1], 0, b-1), query(ver[b-1], 0, a-1));
            if (j == 0) j = -1;
            cout << j << " ";
        }
        cout << endl;

    }

    return 0;
}
