#include <bits/stdc++.h>
#define int long long

using namespace std;

void solve () {
	int n, m;
	cin >> n >> m;
	
    vector <vector <int>> e (n);
    for (int i = 0; i < m; i ++) {
        int x, y;
        cin >> x >> y;
        x --; y --;

        if (x == y) {
            continue;
        }
        if (x > y) {
            swap (x, y);
        }
        e[x].push_back (y);
    }

    for (int i = 0; i < n; i ++) {
        sort (e[i].begin (), e[i].end ());
        e[i].erase (unique (e[i].begin (), e[i].end ()), e[i].end ());
    }

    vector <int> fa (n, -1);
    int ans = 0;
    int now;

    vector <int> nfa;

    auto dfs = [&](auto &&self, int x) -> void {
        now = x;
        for (auto y : e[x]) {
            fa[y] = x;            
        }
        const int N = e[x].size ();
        for (int i = 0; i < N; i ++) {
            int y = e[x][i];
            if (y <= now) {
                continue;
            }
            if (i < N - 1) {
                nfa.push_back (x);
            }
            if (y == now + 1) {
                self (self, y);
                nfa.pop_back ();
                continue;
            }
            nfa.push_back (x);
            while (y > now + 1) {
                ans ++;
                self (self, now + 1);
            }
            nfa.pop_back ();
        }
        if (x == n - 1) {
            return;
        }
        if (now == x) {
            if (fa[x + 1] == -1 || (nfa.size () && nfa.back () != fa[x + 1])) {
                ans ++;
            }
            self (self, x + 1);
        }
    };
    dfs (dfs, 0);

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

signed main () {
    ios::sync_with_stdio (false);
    cin.tie (nullptr);

    int T = 1;
    cin >> T;

    while (T --) {
        solve ();
    }

    return 0;
}