from sys import stdin
input = stdin.readline

N, M, L = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N)]

MOD = 998244353

cnt = [[0]*L for _ in range(M)]
for A, B in AB:
    A, B = A-1, B-1-M
    cnt[A][B] += 1
for i in range(M):
    for j in range(L):
        cnt[i][j] = (pow(2, cnt[i][j])-1)%MOD

dp = [0]*(1<<L)
dp[0] = 1
for i in range(M):
    ndp = dp[:]
    for j in range(L):
        for bit in range(1<<L):
            if 1<<j & bit:
                ndp[bit] += ndp[bit]*cnt[i][j]%MOD
                ndp[bit] %= MOD
    for j in range(L):
        for bit in range(1<<L):
            if not 1<<j & bit:
                ndp[bit|1<<j] += ndp[bit]*cnt[i][j]%MOD
                ndp[bit|1<<j] %= MOD
    dp = [(ndp[bit]-dp[bit])%MOD for bit in range(1<<L)]

print(dp[-1])