#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 7;
struct node {
  long long l, r, i;
};
bool cmp(node &a, node &b) { return a.l < b.l; }
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t;
  t = 1;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long x, y;
    bool flag = 0;
    vector<long long> ans(n);
    vector<node> a;
    for (long long i = 0; i < n; i++) {
      cin >> x >> y;
      a.push_back({x, y, i});
    }
    sort((a).begin(), (a).end(), cmp);
    long long p = -1;
    x = a[0].r;
    for (long long i = 1; i < n; i++) {
      if (x < a[i].l) {
        p = i;
        break;
      }
      x = max(x, a[i].r);
    }
    if (p == -1)
      cout << -1 << '\n';
    else {
      for (long long i = 0; i < p; i++) ans[a[i].i] = 1;
      for (long long i = p; i < n; i++) ans[a[i].i] = 2;
      for (auto i : ans) cout << i << " ";
      cout << '\n';
    }
  }
  return 0;
}
