#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
using namespace std;
using LL = long long;
typedef pair<int, int> PII;
const int N = 1e5 + 10, M = 5010, mod = 1e9 + 7;
const int inf = 1e18;
void solve(){
	int n, k;
	cin >> n >> k;
	vector <PII> a(k + 1);
	for(int i = 1; i <= k; i++){
		cin >> a[i].x >> a[i].y;
	}
	sort(a.begin() + 1, a.end(), [&](PII a, PII b){
		return (a.y - a.x) > (b.y - b.x);
	});
	vector <int> fa(n + 1);
	int root = -1;
	if(a[1].y - a[1].x == a[k].y - a[k].x){
		if(a[1].y - a[1].x + 1 == 1 && k > 1) cout << "IMPOSSIBLE\n";
		else{
			root = a[1].x;
			fa[root] = 0;
			for(int j = a[1].x + 1; j <= a[1].y; j++){
				fa[j] = j - 1;
			}
			for(int i = 2; i <= k; i++){
				fa[a[i].x] = root;
				for(int j = a[i].x + 1; j <= a[i].y; j++){
					fa[j] = j - 1;
				}
			}
			for(int i = 1; i <= n; i++) cout << fa[i] << " \n"[i == n];
		}
	}else{
		root = a[1].x;
		fa[root] = 0;
		for(int j = a[1].x + 1; j <= a[1].y; j++){
			fa[j] = j - 1;
		}
		for(int i = 2; i <= k; i++){
			fa[a[i].x] = root;
			for(int j = a[i].x + 1; j <= a[i].y; j++){
				fa[j] = j - 1;
			}
		}
		for(int i = 1; i <= n; i++) cout << fa[i] << " \n"[i == n];
	}
}
signed main() {
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T = 1;
	cin >> T;
	while(T--) {
		solve();
	}
}