// MagicDark
#include <bits/stdc++.h>
#define mid ((l + r) >> 1)
#define lc num << 1
#define rc lc | 1
#define li lc, l, mid
#define ri rc, mid + 1, r
#define debug cerr << "\33[32m[" << __LINE__ << "]\33[m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T &x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T &x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = - f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 1e6 + 10, inf = 1e9;
int n, l[N], r[N], m;
vector <int> v[N];
vector <pair <int, int>> vv[N];
// int tag[N << 2];
// pair <int, int> info[N << 2];
// void build(int num, int l, int r) {
// 	info[num] = make_pair(- r, r);
// 	if (l == r) return;
// 	build(li), build(ri);
// }
// void down(int num, int x) {
// 	tag[num] += x;
// }
// void pushdown(int num) {
// 	if (tag[num]) {
// 		down(lc, tag[num]), down(rc, tag[num]);
// 		tag[num] = 0;
// 	}
// }
// void pushup(int num) {
// 	info[num] = max(info[lc], info[rc]);
// }
// void change(int num, int l, int r, int L, int R, int x) {
// 	if (l == r) return down(num, x);
// 	pushdown(num);
// 	if (mid >= L) change(li, L, R, x);
// 	if (mid < R) change(ri, L, R, x);
// 	pushup(num);
// }
// bool vis[N];
int ss[N], ans[N];
void zhk() {
	read(n);
	set <pair <int, int>> s;
	F(i, 1, n) {
		ans[i] = 0;
		read(l[i]), read(r[i])--;
		F(_, 1, 3) {
			auto pos = s.lower_bound(make_pair(l[i], inf));
			int tl = l[i], tr = l[i];
			if (pos != s.begin()) {
				auto pp = prev(pos);
				if (pp -> second + 1 >= l[i]) {
					tl = pp -> first;
					tr = pp -> second + 1;
					s.erase(pp);
				}
			}
			// int tr = tl;
			// auto pp = next(pos);
			if (pos != s.end() && pos -> first == tr + 1) {
				tr = pos -> second;
				s.erase(pos);
			}
			s.emplace(tl, tr);
			// for (auto [l, r]: s) debug << l << ' ' << r << '\n';
			// debug << endl;
		}
	}
	vector <int> w;
	// for (auto [l, r]: s) {
	// 	debug << l << " " << r << endl;
	// }
	for (auto [l, r]: s)
		F(i, l, r) {
			// debug << i << endl;
			w.push_back(i);
		}
	m = w.size();
	set <int> g;
	F(i, 1, m + 5) g.insert(i), v[i].clear(), vv[i].clear();
	F(i, 0, m + 1) ss[i] = 0;
	F(i, 1, n) {
		l[i] = lower_bound(all(w), l[i]) - w.begin() + 1;
		r[i] = upper_bound(all(w), r[i]) - w.begin();
		v[r[i]].push_back(l[i]);
		vv[l[i]].emplace_back(r[i], i);
	}
	F(i, 1, m) {
		for (int j: v[i]) {
			auto it = g.upper_bound(j);
			F(_, 1, 2) {
				if (* it == i + 3) {
					puts("-1");
					return;
				}
				it = g.erase(it);
			}
		}
		auto pos = prev(g.lower_bound(i + 3));
		int w = * pos;
		if (w <= i) {
			ss[w]++, ss[i + 2]--;
		}
		// assert(pos)
	}
	priority_queue <pair <int, int>, vector <pair <int, int>>, greater <pair <int, int>>> q;
	F(i, 1, m)
		if (i > 1) ss[i] += ss[i - 2];
	F(i, 1, m) {
		if (!ss[i - 1] && !ss[i + 1]) ss[i] = 1;
		for (auto t: vv[i]) q.push(t);
		if (ss[i]) {
			// debug << "@ " << i << endl;
			if (q.size()) {
				auto [a, b] = q.top(); q.pop();
				assert(a >= i);
				ans[b] = i;
			}
		}
	}
	// for (int i: w) cout << i << ' '; cout << '\n';
	assert(q.empty());
	F(i, 1, n) assert(ans[i]);
	F(i, 1, n) cout << w[ans[i] - 1] << ' '; cout << '\n';
}
signed main() {
	int _ = 1;
	cin >> _;
	while (_--) zhk();
	return 0;
}
/* why?
*/