#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define int ll

int read(){
    int red=0, f_f=1; char c=getchar();
    while (c<'0'||c>'9'){if (c=='-')f_f=-1;c=getchar();}
    while (c>='0'&&c<='9'){red=(red<<1)+(red<<3)+(c^48);c=getchar();}
    return f_f*red;
}

const int N = 1e5+5;

int n, m, l, r, t, b[N];
struct node {
    int l, r;
    bool operator <(const node &B) const {
        return (l < B.l) || (l == B.l && r > B.l);
    }
}a[N];
set<int>s;


void solve() {
    n = read(), m = read();
    for(int i = 1; i <= m; i++) {
        a[i].l = read(), a[i].r = read();
    }
    for(int i = 1; i <= n; i++) b[i] = 1;
    sort(a+1, a+1+m);
    l = 0, r = 0, t = 1;
    s.insert(1);
    for(int i = 1; i <= m; i++) {
        if(a[i].l >= l && a[i].r <= r) continue;
        if(r < a[i].l) {
            for(int j = a[i].l+1; j <= a[i].r; j++)
                b[j] = b[j-1]+1;
            l = a[i].l, r = a[i].r;
            t = max(t, r-l+1);
        }
        else {
            for(int j = l; j < a[i].l; j++)
                s.insert(b[j]);
            for(int j = r+1; j <= a[i].r; j++) {
                if(s.size()) {
                    b[j] = *(s.begin());
                    s.erase(s.begin());
                }
                else b[j] = ++t;
            }
            l = a[i].l, r = a[i].r;
        }
    }
    for(int i = 1; i <= n; i++) printf("%d ", b[i]);
    printf("\n");
}

signed main() {
    // IOS;
    int T = read();
    while (T--) {
        solve();
    }
    return 0;
}