#include<stdio.h>
#include<iostream>
#include<algorithm>
#define inf 0X7fffffff
using namespace std;
const int N=5e5+9;
int read(int &x){
    int dat=0,oko=1;char chc=getchar();
    while(chc<'0'||chc>'9'){if(chc=='-')oko=-1;chc=getchar();}
    while(chc>='0'&&chc<='9'){dat=dat*10+chc-'0';chc=getchar();}
    x=dat*oko;return x;
}int n,m,ans[N],r,tip;
struct node{
    int l,r,len;
}a[N];bool cmp(node A,node B){
    return A.len>B.len;
}
void solve(){
    cin>>n>>m;
    for(int i=1;i<=n;i++)ans[i]=0;
    for(int i=1;i<=m;i++){
        cin>>a[i].l>>a[i].r;
        a[i].len=a[i].r-a[i].l+1;
    }sort(a+1,a+1+m,cmp);
    tip=2,r=1;
    bool flag=false;
    while(a[tip].len==a[1].len&&tip<=m){
        ans[a[tip].l]=a[1].l;flag=true;
        if(tip==m){
            cout<<"IMPOSSIBLE"<<"\n";
            return;
        }tip++;
    }while(tip<m){
        ans[a[tip].l]=a[1].l;tip++;
    }ans[a[m].l]=a[1].l+1;
    for(int i=1;i<=n;i++){
        if(ans[i]||i==a[1].l)cout<<ans[i]<<" ";
        else cout<<i-1<<" ";
    }cout<<"\n";
}
int main(){
    int T;cin>>T;
    while(T--)solve();
    return 0;
}