#include <iostream>
#include <vector>
#include <set>
using namespace std;
using vi = vector<int>;

vector<vector<int>> sortAdj(vector<vector<int>> &adj) {
	vector<vector<int>> out(adj.size());
	for (int i = 0; i < adj.size(); i++) {
		for (int j : adj[i]) {
			out[j].push_back(i);
		}
	}
	return out;
}

void solve() {
	int n, m; cin >> n >> m;
	vector<vector<int>> adj(n+1);
	for (int i = 0; i < m; i++) {
		int u, v; cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	adj = sortAdj(adj);
	vi st;

	st.push_back(1);
	int out = 0;
	while (st.size()) {
		int top = st.back();
		st.pop_back();
		if (top == n) break;
		while (st.size() && st.back() <= top) st.pop_back();
		for (int i : adj[top]) {
			if (i > top) {
				st.push_back(i);
			}
		}
		if (st.size() && st.back() == top+1) continue;
		out++;
		st.push_back(top+1);
	}
	cout << out << endl;
}

int main() {
	int t; cin >> t;
	while (t--) solve();
}