import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998_244_353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }
void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto t = RD!int;
	auto ans = new int[](t);
	foreach (ti; 0..t)
	{
		auto n = RD!int;
		auto m = RD!int;
		
		auto pos = new int[][](m);
		auto yoko = new int[](n);
		auto tate = new int[](n);
		yoko[] = -1;
		tate[] = -1;
		foreach (i; 0..m)
		{
			auto y = RD!int-1;
			auto x = RD!int-1;
			pos[i] = [y, x];
			yoko[y] = i;
			tate[x] = i;
		}

		bool done;
		while (!done)
		{
			debug
			{
				writeln(pos);
				writeln(yoko);
				writeln(tate);
			}
			void impl(int i)
			{
				if (yoko[i] == tate[i] || (yoko[i] != -1 && tate[i] != -1)) return;

				int id;
				if (yoko[i] != -1)
					id = yoko[i];
				else
					id = tate[i];
				if (pos[id][0] != i)
				{
					yoko[pos[id][0]] = -1;
					yoko[i] = id;
					auto last = pos[id][0];
					pos[id][0] = i;
					++ans[ti];
					impl(last);
				}
				else if (pos[id][1] != i)
				{
					tate[pos[id][1]] = -1;
					tate[i] = id;
					auto last = pos[id][1];
					pos[id][1] = i;
					++ans[ti];
					impl(last);
				}
				debug
				{
					writeln(pos);
					writeln(yoko);
					writeln(tate);
				}
			}
			foreach (i; 0..n)
			{
				impl(i);
			}
			done = true;
			foreach (i; 0..n)
			{
				if (yoko[i] == -1 || tate[i] == -1) continue;
				else if (yoko[i] == tate[i]) continue;
				
				done = false;
				foreach (j; 0..n)
				{
					if (!(yoko[j] != -1 && tate[j] != -1)) continue;

					auto id = yoko[i];
					yoko[i] = -1;
					yoko[j] = id;
					tate[pos[id][1]] = -1;
					tate[j] = id;
					pos[id] = [j, j];
					ans[ti] += 2;
					break;
				}
				break;
			}
		}
	}

	foreach (e; ans)
		writeln(e);
	stdout.flush;
	debug readln;
}