/*
    ThunderClap and Flash
    Raunaq Singh
*/
#include "bits/stdc++.h" 
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
#define ThunderClap ios::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
#define debugg(something)   cout<<#something<<" - "<<something<<"\n";
#define s second
#define f first
#define MAX 100000LL
#define mod 1000000007LL
#define inf 7000000000000000000LL
#define mI2 500000004LL
inline ll add(ll a, ll b){ return ((a%mod) + (b%mod))%mod;}
inline ll mul(ll a, ll b){ return ((a%mod) * (b%mod))%mod;}
inline ll sub(ll a, ll b){ return ((a%mod) - (b%mod) + mod)%mod;}

void Flash() {
    ll n;
    cin>>n;
    vector <ll> aa[n];

    for (ll i = 0; i < n; i++) {
        aa[i].assign(3, 0);
        cin>>aa[i][0]>>aa[i][1];
        aa[i][2] = i; 
    }

    sort(aa, aa + n, [](const vector <ll> &A, const vector <ll> &B) {
        return A[0] > B[0];
    });
    ll ans[n];
    memset(ans, -1, sizeof(ans));
    map <ll, ll> ind;
    ll j = n;
    for (ll i = n - 1; i >= 0; i--) {
        j = i - 1;
        while (j >= 0 && aa[j][0] == aa[i][0]) {
            j--;
        }
        ++j;
        for (ll k = j; k <= i; k++) {
            auto it = ind.lower_bound(aa[k][1]);
            if (it != ind.begin()) {
                it--;
                ans[aa[k][2]] = (it -> second) + 1;
            }
        }
        for (ll k = j; k <= i; k++) {
            ind[aa[k][1]] = aa[k][2];
        }
        i = j;
    }

    sort(aa, aa + n, [](const vector <ll> &A, const vector <ll> &B) {
        return A[1] > B[1];
    });
    
    ll hMin[n];
    hMin[n - 1] = n - 1;
    for (ll i = n - 2; i >= 0; i--) {
        if (aa[hMin[i + 1]][0] > aa[i][0]) {
            hMin[i] = i;
        } else {
            hMin[i] = hMin[i + 1];
        }
    }

    ll high, low, mid;
    for (ll i = n - 1; i >= 0; i--) {
        high = n - 1;
        low = 0;
        while (high >= low) {
            mid = high + low;
            mid /= 2;
            if (aa[i][0] > aa[mid][1]) {
                high = mid - 1;
            } else {
                low = mid + 1;
            }
        }

        if ((high + 1) < n && aa[i][1] > aa[hMin[high + 1]][0]) {
            ans[aa[i][2]] = aa[hMin[high + 1]][2] + 1;
        }
    }

    for (ll i = 0; i < n; i++) {
        cout<<ans[i]<<" ";
    }
    cout<<"\n";
}

int main(int argc, char const *argv[]) { 
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
    #endif
    ThunderClap;
    ll t = 1;
    cin>>t;
    for(ll i = 1; i <= t; i++) {
        //cout<<"Case #"<<i<<": ";
        Flash();
    }
    return 0;
}