#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define mem(a,b) memset((a),(b),sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
#define int long long
#define db long double

const double eps = 1e-6;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;

int n, m;

struct node {
    int l, r;

    bool operator < (const node &n1) const {
        if (l == n1.l) return r < n1.r;
        return l < n1.l;
    }
};

vector<node> vv;

int ans[maxn];

void solve() {
    vv.clear();
    cin >> n >> m;
    for (int i = 1, l, r; i <= m; i++) {
        cin >> l >> r;
        vv.push_back({l, r});
    }
    sort(vv.begin(), vv.end());
    for (int i = 1; i <= n; i++) ans[i] = 1;
    set<int> s;
    for (int i = 1; i <= n; i++) {
        s.insert(i);
    }
    int lastl = 1, lastr = 0;
    for (int i = 0; i < vv.size(); i++) {
        if (vv[i].l > lastl) {
            for (int j = lastl; j < vv[i].l; j++) {
                s.insert(ans[j]);
            }
            lastl = vv[i].l;
        }
        int nowl = max(lastr + 1, vv[i].l);
        for (int j = nowl; j <= vv[i].r; j++) {
            ans[j] = *s.begin();
            s.erase(ans[j]);
        }
        lastr = max(lastr, vv[i].r);
    }
    for (int i = 1; i <= n; i++) {
        cout << ans[i] << ' ';
    }
    cout << '\n';
}

signed main(){
    io;
    int T = 1;
    cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}