#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
int const maxn = 25e4 + 5;
set < int > b[3];
int lef[maxn], righ[maxn];

main() {
#ifdef HOME
    freopen("input.txt", "r", stdin);
#endif // HOME
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--) {
        int n, m, u, v;
        cin >> n >> m;
        for (int j = 0; j < 3; j++) b[j] = {};
        for (int i = 1; i < n; i++) b[0].insert(i), lef[i] = n, righ[i] = 0;
        for (int M = 1; M <= m; M++) {
            cin >> u >> v;
            if (u > v) swap(u, v);

            for (int j = u; j < v; j++) {
                lef[j] = min(lef[j], v);
                righ[j] = max(righ[j], u - 1);
            }

            for (int j = 1; j >= 0; j--) {
                auto it = b[j].lower_bound(u);
                vector < int > del;
                while (it != b[j].end() && *it < v) {
                    del.push_back(*it);
                    it++;
                }
                for (auto key : del) {
                    b[j].erase(key);
                    b[j + 1].insert(key);
                }
            }

            ll ans = 0, cnt = b[0].size();
            ans += (ll)M * cnt;
            ans += b[1].size();
            ans += cnt * (n - 2);
            ans -= cnt * (cnt - 1);

            for (int i = 1; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    if (lef[i] > j && righ[j] < i) ans++;
                }
            }

            cout << ans << '\n';
        }
    }
    return 0;
}