#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int T;
    cin >> T;

    while (T--) {
        int N, Q;
        cin >> N >> Q;
        vector<int> seg_end(N + 1, 0);
        vector<bool> reset(N + 1, true);

        for (int i = 0; i < Q; i++) {
            int s, e;
            cin >> s >> e;
            seg_end[s] = max(seg_end[s], e);
        }

        int end = 0;
        int prev = -1;

        for (int i = 1; i <= N; i++) {
            if (seg_end[i] <= end)
                continue;

            for (int j = max(i + 1, end + 2); j <= seg_end[i]; j++)
                reset[j] = false;

            end = seg_end[i];
        }

        int combo = 1;
        for (int i = 1; i <= N; i++) {
            if (reset[i])
                combo = 1;

            cout << combo << ' ';
            combo++;
        }
        cout << '\n';
    }
}