#include <bits/stdc++.h>
const int inf = 1039074182;
using namespace std;
int T;
int n;
pair<pair<int, int>, int> a[100005];
int minx[100005];
vector<int> res;
bool use[100005];
void solve() {
  res.clear();
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    use[i] = false;
  }
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &a[i].first.first, &a[i].first.second);
    a[i].second = i;
  }
  sort(a, a + n);
  minx[n] = 200005;
  for (int i = n - 1; i >= 0; i--) {
    minx[i] = min(minx[i + 1], a[i].first.second);
  }
  int r = a[0].first.second;
  bool flag = false;
  res.push_back(a[0].second);
  for (int i = 1; i < n; i++) {
    if (r < a[i].first.first) {
      flag = true;
      break;
    }
    r = max(r, a[i].first.second);
    res.push_back(a[i].second);
  }
  if (flag == false) {
    printf("-1\n");
  } else {
    for (int i = 0; i < res.size(); i++) {
      use[res[i]] = true;
    }
    for (int i = 0; i < n; i++) {
      printf("%d ", (int)use[i] + 1);
    }
    printf("\n");
  }
}
int main() {
  scanf("%d", &T);
  while (T--) {
    solve();
  }
  return 0;
}
