#include<bits/stdc++.h>

using namespace std;

void solve(){
    priority_queue<int,vector<int>,greater<int>> q;
    int n,m; cin>>n>>m;
    for (int i=1;i<=n;++i) q.push(i);
    vector r(n+1,n+1);
    vector a(n+1,0);
    for (int i=1;i<=m;++i){
        int x,y; cin>>x>>y;
        r[y]=min(r[y],x);
    }
    r[n]=min(r[n],n);
    for (int i=n-1;i>=1;--i){
        r[i]=min(r[i],i);
        r[i]=min(r[i+1],r[i]);
    }
    int j=1;
    for (int i=1;i<=n;++i){
        int l=r[i];
        while (j<l){
            q.push(a[j]);
            ++j;
        }
        a[i]=q.top();
        q.pop();
        cout<<a[i]<<" \n"[i==n];
    }
}
int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int T; cin>>T;
    while (T--) solve();
}