#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<ll> vll;
//#define DEBUG
#ifdef DEBUG
const ll N = 60;
#endif
#ifndef DEBUG
const ll N = 60;
#endif
ll n, k, M, nframe;
bool isFrame[N];
pii swapper[15];
vll frames;
ll id[N][N];

ll dfs(vll &target, ll depth)
{
	if(depth == k) return 1;
	if(target[swapper[depth].first] > target[swapper[depth].second]) return 0;
	
	ll ans  = dfs(target, depth+1);
	swap(target[swapper[depth].first], target[swapper[depth].second]);
	ans = (ans + dfs(target, depth+1)) % M;
	swap(target[swapper[depth].first], target[swapper[depth].second]);
	
	return ans;
}



ll g(vll target)
{
	return dfs(target, 0);
	
}
ll f(ll pos, ll jmp)
{
	if(jmp > pos)
	{
		ll u = (jmp == nframe-1? n: frames[jmp+1]); 
		ll d = frames[jmp];
		return id[pos][u-1] - id[pos][d-1];
	}
	else if(jmp < pos)
	{
		ll u = frames[jmp];
		ll d = (jmp == 0? -1: frames[jmp-1]);
		return id[pos][u] - (d == -1? 0 :id[pos][d]);
	}
	else
	{
		ll u = (jmp == nframe-1? n: frames[jmp+1]); 
		ll d = (jmp == 0? -1: frames[jmp-1]);
		return id[pos][u-1] - (d == -1? 0: id[pos][d]);
	}
}
ll calc(ll pos, ll jmp)
{
	vll target(nframe);
	target[pos] = jmp;
	ll val = 0;
	for(ll i=0; i<nframe; i++)
	{
		if(i == pos) continue;
		if(val == jmp) val++;
		target[i] = val;
		val++;
	}
	return g(target) * f(pos, jmp) % M;
}
int main()
{
	#ifdef DEBUG
	freopen("1.txt", "r", stdin);
	#endif
	#ifndef DEBUG
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	#endif
	ll z;
	cin >> z;
	for(ll i=0; i<=50; i++)
		for(ll j=0; j<=50; j++)
			id[i][j] = 1;
	for(ll i=1; i<=50; i++)
	{
		id[i][i] = 0;
		id[i][i-1] = 0;
	}
	for(ll i=0; i<=50; i++)
		for(ll j=1; j<=50; j++)
			id[i][j] += id[i][j-1];
	while(z--)
	{
		cin >> n >> k >> M;
		memset(isFrame, 0, n+5);
		frames.clear();
		for(ll i=0; i<k; i++)
		{
			ll u, v;
			cin >> u >> v;
			u--, v--;
			isFrame[u] = 1;
			isFrame[v] = 1;
			swapper[i] = {u, v};
		}
		nframe = 0;
		for(ll i=0; i<n; i++) if(isFrame[i])
		{
			nframe++;
			frames.push_back(i);
		}
		ll ans = 0;
		for(ll i=0; i<nframe; i++)
			for(ll j=0; j<nframe; j++)
			{
				if(j == i || j == i-1) continue;
				ans = (ans + calc(i, j)) % M;
			}
		ll same = 0;
		for(ll i=0; i<nframe; i++) same += f(i, i);
		for(ll i=0; i<n; i++) if(!isFrame[i])
			same += id[i][n-1];
		vll target(nframe);
		for(ll i=0; i<nframe; i++) target[i] = i;
		ans = (ans + same*g(target)) % M;
		cout << ans << '\n';
	}
	return 0;
}//