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

POW2 = [0 for _ in range(N + 1)]
POW2[0] = 1
for x in range(N):
	POW2[x + 1] = POW2[x] * 2 % MOD

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[x] + g_old[x]) % MOD
			g[x | (1 << j)] = (g[x | (1 << j)] + g_old[x] * (POW2[cnt[i][j]] - 1)) % MOD
	g[0] = 0
	
	y = 1
	while y < (1 << L):
		for x in range(1 << L):
			if (y & x) == 0:
				f[y | x] = (f[y | x] + f[x]) % MOD
				g[y | x] = (g[y | x] + g[x]) % MOD
		y <<= 1
		
	for x in range(1 << L):
		f[x] = (f[x] * g[x]) % MOD

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