MOD = 998244353

N, M, L = map(int, input().split())
cnt = [[0 for j in range(L)] for i in range(M)]

for i in range(N):
	A, B = map(int, input().split())
	cnt[A - 1][(B - M) - 1] += 1

f = [0 for _ in range(1 << L)]
f[0] = 1


for i in range(M):
	g = [0 for x in range(1 << L)]
	g[0] = 1
	for j in range(L):
		g_old = [0 for x in range(1 << L)]
		g, g_old = g_old, g
		for x in range(1 << L):
			g[x] += g_old[x]
			g[x | (1 << j)] += g_old[x] * (pow(2, cnt[i][j], MOD) - 1)
	g[0] = 0
	
	y = 1
	while y < (1 << L):
		for x in range(1 << L):
			if (y & x) == 0:
				f[y | x] += f[x]
				g[y | x] += g[x]
		y <<= 1
		
	for x in range(1 << L):
		f[x] *= g[x]

	y = 1
	while y < (1 << L):
		for x in range(1 << L):
			if (y & x) == 0:
				f[y | x] -= f[x]
		y <<= 1
	
print(f[(1 << L) - 1])