#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define PII pair<int, int>

const int N = 60;
int n, m;
LL d[N], d1[N], k[N], ans;

int q[N], tt;
bool work(vector<PII> &s)
{
	q[tt = 1] = 1;
	LL flag = 1 << 1;
	while(tt)
	{
		int t = q[tt--];
		LL p = d[t] ^ (d[t] & flag);
		flag |= d[t];
		while(p)
		{
			int num = __builtin_ctzll(p & -p);
			p ^= p & -p;
			s.push_back({t, num}), q[++tt] = num;
		}
	}
	if(flag != (1ll << n + 1) - 2) return false;
	q[tt = 1] = 1, flag = 1 << 1;
	while(tt)
	{
		int t = q[tt--];
		LL p = d1[t] ^ (d1[t] & flag);
		flag |= d1[t];
		while(p)
		{
			int num = __builtin_ctzll(p & -p);
			p ^= p & -p;
			s.push_back({num, t}), q[++tt] = num;
		}
	}
	if(flag != (1ll << n + 1) - 2) return false;
	return true;
}

void dfs(int x)
{
	vector<PII> s, s1;
	if(!work(s))
	{
		LL cnt = m;
		for(int i = 1; i <= n; i++) 
			cnt -= __builtin_popcount(k[i]);
		if(x == 1) ans += cnt * (cnt - 1) * (cnt - 2) / 6;
		else if(x == 2) ans += cnt * (cnt - 1) / 2;
		else if(x == 3) ans += cnt;
		else ans++;
		return;
	}
	if(x == 4) return;
	
	for(PII i : s)
		if(k[i.first] >> i.second & 1 ^ 1)
		{
			d[i.first] ^= 1ll << i.second, d1[i.second] ^= 1ll << i.first;
			k[i.first] ^= 1ll << i.second;
			s1.push_back(i);
			dfs(x + 1);
			d[i.first] ^= 1ll << i.second, d1[i.second] ^= 1ll << i.first;
		}
	for(PII i : s1) k[i.first] ^= 1ll << i.second;
}

int main()
{
	int T;
	cin >> T;
	while(T--)
	{
		memset(d, 0, sizeof(d));
		memset(d1, 0, sizeof(d1));
		memset(k, 0, sizeof(k));
		ans = 0;
	
		cin >> n >> m;
		for(int i = 1; i <= m; i++)
		{
			int a, b;
			scanf("%d%d", &a, &b);
			d[a] |= 1ll << b, d1[b] |= 1ll << a;
		}
		dfs(1);
		cout << ans << endl;
	}
	return 0;
}