#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

void dfs(const vector<vector<PII>>& g, VI& used, int& sz, int& sumDeg, int& maxDeg, int v)
{
	used[v] = 1;
	sz++;
	sumDeg += SZ(g[v]);
	maxDeg = max(maxDeg, SZ(g[v]));
	for (auto [to, i] : g[v])
	{
		if (!used[to])
			dfs(g, used, sz, sumDeg, maxDeg, to);
	}
}

void solve()
{
	int n, m, k;
	cin >> n >> m >> k;
	vector<vector<PII>> g(n);
	FOR(i, 0, m)
	{
		int u, v;
		cin >> u >> v;
		u--;
		v--;
		g[u].PB({v, i});
		g[v].PB({u, i});
	}
	int ans = n;
	int maxVertices = n + 47;
	int iterations = 0;
	bool tooBig = false;
	FOR(i, 1, min(k, 47))
	{
		ans = min(ans, m);
		LL newM = 0;
		FOR(v, 0, n)
			newM += SZ(g[v]) * (SZ(g[v]) - 1LL) / 2;;
		if (newM > maxVertices)
		{
			tooBig = true;
			break;
		}
		vector<vector<PII>> ng(m);
		int idx = 0;
		FOR(v, 0, n)
		{
			FOR(j, 0, SZ(g[v]))
			{
				int e1 = g[v][j].S;
				FOR(l, j + 1, SZ(g[v]))
				{
					int e2 = g[v][l].S;
					ng[e1].PB({e2, idx});
					ng[e2].PB({e1, idx});
					idx++;
				}
			}
		}
		assert(idx == newM);
		n = m;
		m = newM;
		g = ng;
		iterations = i;
	}
	if (!tooBig)
	{
		int candAns = 0;
		bool allChainsOrCycles = true;
		VI used(n);
		FOR(v, 0, n)
		{
			int sz = 0, sumDeg = 0, maxDeg = 0;
			if (!used[v])
			{
				dfs(g, used, sz, sumDeg, maxDeg, v);
				allChainsOrCycles &= maxDeg <= 2;
				if (maxDeg <= 2)
					assert(sumDeg == 2 * sz || sumDeg == 2 * (sz - 1));
				candAns += sumDeg >= 2 * sz ? sz : max(0, sz - (k - 1 - iterations));
			}
		}
		if (allChainsOrCycles)
			ans = min(ans, candAns);
	}
	cout << ans << "\n";
}

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	int t;
	cin >> t;
	while (t--)
		solve();
	return 0;
}