func_code_string: // Author : Epsilon573   // If it works, don t touch it.      #include <bits/stdc++.h>   using namespace std;      typedef unsigned long long ull;   typedef long long ll;   typedef long double ld;      const ll mod  = 1e9+7;   const ld eps  = 1e-9 ;   const ll maxn = 1e5+1;   const ll inf  = 1e15 ;   const ll minf = -inf ;      #define mp make_pair   #define pb push_back   #define endl   n       #ifdef EPSILON          #define deb(args...)       cerr <<  [   #args <<   ] :   , debug(args);       #define debug(args...)     (Debugger()) , args           class Debugger       {           public:           Debugger(const std::string& _separator =  ,  ) :           first(true), separator(_separator){}               template<typename ObjectType>           Debugger& operator , (const ObjectType& v)           {               if(!first)                   std::cerr << separator;               std::cerr << v;               first = false;               return *this;           }           ~Debugger() {  std::cerr << endl;}               private:           bool first;           std::string separator;       };           template <typename T1, typename T2>       inline std::ostream& operator << (std::ostream& os, const std::pair<T1, T2>& p)       {           return os <<  (  << p.first <<  ,   << p.second <<  ) ;       }           template<typename T>       inline std::ostream &operator << (std::ostream & os,const std::vector<T>& v)       {           bool first = true;           os <<  [ ;           for(unsigned int i = 0; i < v.size(); i++)           {               if(!first)                   os <<  ,  ;               os << v[i];               first = false;           }           return os <<  ] ;       }           template<typename T>       inline std::ostream &operator << (std::ostream & os,const std::set<T>& v)       {           bool first = true;           os <<  [ ;           for (typename std::set<T>::const_iterator ii = v.begin(); ii != v.end(); ++ii)           {               if(!first)                   os <<  ,  ;               os << *ii;               first = false;           }           return os <<  ] ;       }           template<typename T1, typename T2>       inline std::ostream &operator << (std::ostream & os,const std::map<T1, T2>& v)       {           bool first = true;           os <<  [ ;           for (typename std::map<T1, T2>::const_iterator ii = v.begin(); ii != v.end(); ++ii)           {               if(!first)                   os <<  ,  ;               os << *ii ;               first = false;           }           return os <<  ] ;       }       #else       #define deb(args...)       #define debug(args...)   #endif      bool solve()   {       ll n;       cin >> n;       vector<pair<pair<ll,ll>,ll>> hw(n),wh(n);       vector<ll> ans(n+1,-1),prefw(n),prefh(n),valh(n),valw(n);          for(ll i=0 ; i<n ; ++i)       {           hw[i].second = wh[i].second = i+1;           cin >> (hw[i].first).first >> (hw[i].first).second;           (wh[i].first).first = (hw[i].first).second;           (wh[i].first).second = (hw[i].first).first;       }          sort(hw.begin(),hw.end());       sort(wh.begin(),wh.end());          for(ll i=0 ; i<n ; ++i)       {           if(i){               if((hw[i].first).second < prefw[i-1])               {                   prefw[i] = (hw[i].first).second;                   valw[i] = hw[i].second;               }               else               {                   prefw[i] = prefw[i-1];                   valw[i] = valw[i-1];               }               if((wh[i].first).second < prefh[i-1])               {                   prefh[i] = (wh[i].first).second;                   valh[i] = wh[i].second;               }               else               {                   prefh[i] = prefh[i-1];                   valh[i] = valh[i-1];               }           }           else           {               prefw[i] = (hw[i].first).second;               valw[i] = hw[i].second;               prefh[i] = (wh[i].first).second;               valh[i] = wh[i].second;           }          }             for(ll i=0 ; i<n ; ++i)       {           ll ht = (hw[i].first).first;           ll wt = (hw[i].first).second;              ll low = 0 , high = n-1 , mid , ptr = -1;              while(low<=high)           {               mid = (low+high)/2;                              if( (hw[mid].first).first < ht )               {                   ptr = mid;                   low = mid+1;               }               else               {                   high = mid-1;               }           }              if(ptr==-1) continue;           else           {               if(prefw[ptr] < wt)               {                   ans[hw[i].second] = valw[ptr];               }           }          }          for(ll i=0 ; i<n ; ++i)       {           if(ans[hw[i].second]!=-1) continue;              ll ht = (hw[i].first).first;           ll wt = (hw[i].first).second;              ll low = 0 , high = n-1 , mid , ptr = -1;              while(low<=high)           {               mid = (low+high)/2;               if( (wh[mid].first).first < ht )               {                   ptr = mid;                   low = mid+1;               }               else               {                   high = mid-1;               }           }              if(ptr==-1) continue;           else           {               if(prefh[ptr] < wt)               {                   ans[hw[i].second] = valh[ptr];               }           }       }          for(ll i=1 ; i<=n ; ++i) cout << ans[i] <<    ;           cout << endl;          return true;       }      int main()   {       ios_base :: sync_with_stdio(false);       cin.tie(NULL);       cout.tie(NULL);          #ifdef EPSILON       freopen( input.txt , r ,stdin);       freopen( output.txt , w ,stdout);       freopen( error.txt , w ,stderr);       #endif          ll t=1;       cin >> t;          while(t--)       {           if(solve())           {               // do this;           }           else           {               // do this;           }       }          return 0;   } 