#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string.h>
#include<iomanip>
#include<numeric>
#include<stack>
#include<deque>
#include<queue>
#include<vector>
#include<map>
#include<set>
#define ll               long long
#define endl             "\n"
using namespace std;
int t, n, m, fa[200005];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin >> t;
    while (t--)
    {
        cin >> n >> m;
        map<int, vector<pair<int, int>>>mp;
        while (m--)
        {
            ll l, r;
            cin >> l >> r;
            mp[r - l + 1].emplace_back(l, r);
        }
        if ((mp.size() == 1 && mp.rbegin()->second.size() > 1) || (mp.rbegin()->second.size() > 1 && mp.rbegin()->first == 2))
        {
            cout << "IMPOSSIBLE" << endl;
            continue;
        }
        int be = 0, faa = 0;
        for (auto p = mp.rbegin(); p != mp.rend(); p++)
        {
            auto [len, vc] = *p;
            if (!be)
            {
                be = 1;
                fa[vc[0].first] = 0;
                faa = vc[0].first;
                for (int i = vc[0].first + 1; i <= vc[0].second; i++)
                    fa[i] = i - 1;
                for (int i = 1; i < vc.size(); i++)
                {
                    auto [l, r] = vc[i];
                    fa[l] = faa;
                    while (++l <= r)
                        fa[l] = l - 1;
                }
                if (vc.size() > 1)
                    faa++;
            }
            else
            {
                for (int i = 0; i < vc.size(); i++)
                {
                    auto [l, r] = vc[i];
                    fa[l] = faa;
                    while (++l <= r)
                        fa[l] = l - 1;
                }
            }
        }
        for (int i = 1; i <= n; i++)
            cout << fa[i] << " ";
        cout << endl;
    }
    return 0;
}