#include <bits/stdc++.h>
using namespace std;
const long long N_max = 1e5;
long long rightmost[N_max + 5];
long long solution[N_max + 5];
void run_case() {
  long long n, i, l, r, idx;
  cin >> n;
  vector<pair<pair<long long, long long>, long long>> V;
  for (i = 0; i < n; i++) {
    cin >> l >> r;
    V.push_back({{l, r}, i});
  }
  sort(V.begin(), V.end());
  rightmost[0] = V[0].first.second;
  for (i = 1; i < n; i++) {
    rightmost[i] = max(rightmost[i - 1], V[i].first.second);
  }
  bool found = false;
  for (i = 1; i < n; i++) {
    if (V[i].first.first > rightmost[i - 1]) {
      found = true;
      idx = i;
      break;
    }
  }
  if (!found) {
    cout << "-1\n";
  } else {
    for (i = 0; i < idx; i++) solution[V[i].second] = 1;
    for (i = idx; i < n; i++) solution[V[i].second] = 2;
    for (i = 0; i < n; i++) {
      cout << solution[i] << " ";
    }
    cout << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long T = 1;
  cin >> T;
  while (T--) run_case();
  return 0;
}
