#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
int const maxn = 25e4 + 5;
vector < int > L[maxn];
int add[maxn], ok[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 i = 1; i <= n; i++) L[i] = {}, add[i] = 0;
        for (int M = 1; M <= m; M++) {
            cin >> u >> v;
            if (u > v) swap(u, v);
            L[u].push_back(v);
            add[u]++, add[v]--;
            ll ans = 0;
            int bal = 0;
            for (int i = 1; i < n; i++) {
                bal += add[i];
                if (bal == 0) ans += M;
                else if (bal == 1) ans++;
                if (!bal) ok[i] = 1;
                else ok[i] = 0;
            }
            bal = 0;
            for (int i = 1; i < n; i++) {
                bal += add[i];
                if (bal == 0) {
                    ans += (n - i - 1);
                    continue;
                }
                int imin = n + 1, imax = -1;
                for (int j = 1; j <= i; j++) {
                    for (auto key : L[j]) {
                        if (key >= i + 1) {
                            imin = min(imin, key);
                            imax = max(imax, key);
                        }
                    }
                }
                for (int j = i + 1; j < imin; j++) {
                    int flag = 0;
                    for (int pos = i + 1; pos <= j; pos++) {
                        for (auto key : L[pos]) {
                            if (key >= j + 1) flag = 1;
                        }
                    }
                    ans += !flag;
                }
                for (int j = imax; j < n; j++) {
                    ans += ok[j];
                }
            }
            cout << ans << '\n';
        }
    }
    return 0;
}