#include <bits/stdc++.h>
using namespace std;

#define int long long

const int N = 1e6 + 5;

int n, m;
map<int, int> cnt;
vector<array<int, 2>> all;

void solve()
{
    cin >> n >> m;
    cnt.clear(), all.clear();

    int ma = 0, one = 0;
    for (int i = 1; i <= m; i++) {
        int l, r;
        cin >> l >> r;
        int len = r - l + 1;
        cnt[len]++;
        one += len == 1;
        ma = max(ma, len);
        all.push_back({ l, r });
    }
    if (n == 1) {
        cout << 0 << '\n';
        return;
    }
    if (ma == 1) {
        cout << "IMPOSSIBLE\n";
        return;
    }
    vector<int> ans(n + 1, 0);
    sort(all.begin(), all.end(), [](array<int, 2>& p1, array<int, 2>& p2) {
        return p1[1] - p1[0] > p2[1] - p2[0];
    });
    if (cnt[ma] > 1) {
        int flag = 0;
        for (auto it : cnt) {
            if (it.first + 2 <= ma) {
                flag = 1;
                break;
            }
        }
        if (!flag) {
            cout << "IMPOSSIBLE\n";
            return;
        }
        while (all.size()) {
            int li = all.back()[0], ri = all.back()[1];
            if (ma - (ri - li + 1) >= 2) {
                ans[li] = all[0][0] + 1;
                all.pop_back();
            } else
                break;
        }
    }
    for (int i = 0; i < m; i++) {
        int l = all[i][0], r = all[i][1];
        if (i)
            ans[l] = all[0][0];
        for (int j = l + 1; j <= r; j++) {
            ans[j] = j - 1;
        }
    }
    for (int i = 1; i <= n; i++) {
        cout << ans[i] << ' ';
    }
    cout << '\n';
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
}