from itertools import permutations


def solve():
	n, k, m = map(int, input().split())
	p = []
	for i in range(k):
		p.append(list(map(int, input().split())))
		p[i][0] -= 1
		p[i][1] -= 1
	cnt = 0
	for a in permutations(range(1, n+1)):
		a = list(a)
		for x, y in p:
			a[x], a[y] = min(a[x], a[y]), max(a[x], a[y])
		ok = False
		for i in range(n):
			ordered = True
			prev = 0
			for j in range(n):
				if j == i: continue
				if a[j] < prev:
					ordered = False
					break
				prev = a[j]
			if ordered:
				ok = True
				break
		if ok:
			# print(a)
			cnt += 1
	print(cnt)



for _ in range(int(input())):
	solve()