#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <queue>
#include <map>
#include <set>
using namespace std;
using ll=long long;
const int maxn=2e5+5;
const ll mod=998244353;
int fa[maxn],sz[maxn];
struct node{
    int l,r,len;
    bool operator < (const node &nd) const {
        return len>nd.len;
    }
} p[maxn];
void solve() {
    int n,k;
    cin>>n>>k;
    memset(fa, 0, sizeof(int)*(n+1));
    memset(sz, 0, sizeof(int)*(n+1));
    for(int i=0;i<k;i++) {
        cin>>p[i].l>>p[i].r;
        p[i].len=p[i].r-p[i].l+1;
    }
    sort(p,p+k);
    for(int i=0;i<k;i++) {
        for(int j=p[i].r;j>p[i].l;j--) {
            fa[j]=j-1;
        }
    }
    for(int i=p[0].r;i>p[0].l;i--) {
        sz[i-1]=sz[i]+1;
    }
    int now=k-1;
    for(int i=p[0].r-1;i>=p[0].l;i--) {
        while (now>0&&p[now].len<=sz[i]) {
            fa[p[now].l]=i;
            sz[fa[i]]+=p[now].len;
            now--;
        }        
        if(now==0) break;
    }
    if(now) {
        cout<<"IMPOSSIBLE\n";
    }
    else {
        for(int i=1;i<=n;i++)
            cout<<fa[i]<<" ";
        cout<<"\n";
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while (t--) {
        solve();
    }
    return 0;
}