#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
constexpr ll mod = 1000000007;
constexpr ll mod2 = 998244353;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[6] = {1, 0, -1, 0, 1, -1};
const int dy[6] = {0, 1, 0, -1, 1, -1};
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int _;
  cin >> _;
  while (_--) {
    int N;
    cin >> N;
    vector<pair<int, P>> suzu(N);
    for (int i = 0; i < N; i++) {
      cin >> suzu[i].first >> suzu[i].second.first;
      suzu[i].second.second = i;
    }
    sort(suzu.begin(), suzu.end());
    vector<int> ans(N, -1);
    bool can = false;
    ans[suzu[0].second.second] = 1;
    int pos = suzu[0].second.first;
    for (int i = 1; i < N; i++) {
      if (pos < suzu[i].first) {
        for (int j = i; j < N; j++) {
          ans[suzu[j].second.second] = 2;
        }
        can = true;
        break;
      } else {
        ans[suzu[i].second.second] = 1;
        chmax(pos, suzu[i].second.first);
      }
    }
    if (can) {
      for (int i = 0; i < N; i++) {
        cout << ans[i] << (i != N - 1 ? " " : "\n");
      }
    } else {
      cout << -1 << '\n';
    }
  }
  return 0;
}
