#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vpii = vector<pii>;
template <class T>
inline bool ckmin(T& a, const T& b) {
  return b < a ? a = b, 1 : 0;
}
template <class T>
inline bool ckmax(T& a, const T& b) {
  return b > a ? a = b, 1 : 0;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const ll infLL = 1e18;
const ld eps = 1e-6;
struct node {
  int l, r, i;
  bool operator<(const node& other) const { return r < other.r; }
};
void solve() {
  int n;
  cin >> n;
  vector<array<int, 3>> v;
  for (int i = (0); i < (n); i++) {
    int l, r;
    cin >> l >> r;
    v.push_back({l, r, i});
  }
  sort(v.begin(), v.end());
  vi ans(n);
  set<node> second[2];
  second[0].insert({-MOD, -MOD, -MOD});
  second[1].insert({-MOD, -MOD, -MOD});
  int mx = v[0][1];
  bool g = 0;
  for (int i = (1); i < (n); i++) {
    if (v[i][0] > mx) {
      for (int j = (0); j < (i); j++) ans[v[j][2]] = 1;
      for (int j = (i); j < (n); j++) ans[v[j][2]] = 2;
      g = 1;
      break;
    }
    ckmax(mx, v[i][1]);
  }
  if (!g) {
    cout << "-1\n";
    return;
  }
  for (int i = (0); i < (n); i++) cout << ans[i] << ' ';
  cout << nl;
}
int32_t main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
