Problem: There are n segments [l_i, r_i] for 1 ≤ i ≤ n. You should divide all segments into two non-empty groups in such way that there is no pair of segments from different groups which have at least one common point, or say that it's impossible to do it. Each segment should belong to exactly one group.

To optimize testing process you will be given multitest.

Input

The first line contains one integer T (1 ≤ T ≤ 50000) — the number of queries. Each query contains description of the set of segments. Queries are independent.

First line of each query contains single integer n (2 ≤ n ≤ 10^5) — number of segments. It is guaranteed that ∑{n} over all queries does not exceed 10^5.

The next n lines contains two integers l_i, r_i per line (1 ≤ l_i ≤ r_i ≤ 2 ⋅ 10^5) — the i-th segment.

Output

For each query print n integers t_1, t_2, ..., t_n (t_i ∈ \{1, 2\}) — for each segment (in the same order as in the input) t_i equals 1 if the i-th segment will belongs to the first group and 2 otherwise.

If there are multiple answers, you can print any of them. If there is no answer, print -1.

Example

Input


3
2
5 5
2 3
3
3 5
2 3
2 3
3
3 3
4 4
5 5


Output


2 1 
-1
1 1 2 

Note

In the first query the first and the second segments should be in different groups, but exact numbers don't matter.

In the second query the third segment intersects with the first and the second segments, so they should be in the same group, but then the other group becomes empty, so answer is -1.

In the third query we can distribute segments in any way that makes groups non-empty, so any answer of 6 possible is correct.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
long long qpow(long long x, long long y) {
  long long s = 1;
  while (y) {
    if (y & 1) s = s * x % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return s;
}
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * f;
}
long long inve(long long x) {
  return x == 1 ? 1 : (mod - mod / x) * inve(mod % x) % mod;
}
const int maxn = 2e5 + 5;
struct node {
  int l, r, id;
};
vector<node> v;
bool cmp(node a, node b) {
  if (a.l == b.l) return a.r < b.r;
  return a.l < b.l;
}
int ans[maxn];
int main() {
  int n, t;
  scanf("%d", &t);
  while (t--) {
    v.clear();
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
      int l, r;
      scanf("%d%d", &l, &r);
      v.push_back((node){l, r, i});
    }
    sort(v.begin(), v.end(), cmp);
    int st = v[0].l, ed = v[0].r;
    int flag = 0;
    ans[v[0].id] = 1;
    for (int i = 1; i < n; i++) {
      node tmp = v[i];
      if (tmp.l <= st && tmp.r >= ed) {
        st = tmp.l;
        ed = tmp.r;
        ans[v[i].id] = 1;
      } else if (tmp.l <= ed && tmp.r <= ed) {
        ans[v[i].id] = 1;
      } else if (tmp.l <= ed && tmp.r > ed) {
        ed = tmp.r;
        ans[v[i].id] = 1;
      } else if (tmp.l > ed) {
        flag = 1;
        ans[v[i].id] = 2;
      }
    }
    if (flag) {
      for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
      printf("\n");
    } else
      puts("-1");
  }
  return 0;
}