mod = 998244353
n, h, w = list(map(int, input().split()))
A = [[1 for _ in range(w)] for _ in range(h)]
for _ in range(n):
    a, b = list(map(lambda x: int(x)-1, input().split()))
    A[a][b-h] = A[a][b-h] * 2 % mod
for y in range(h):
    for x in range(w):
        A[y][x] -= 1
dp = [0] * (1<<w)
dp[0] = 1
for y in range(h):
    ndp = [0] * (1<<w)
    for x in range(w):
        for bit in range((1<<w)-1, -1, -1):
            nbit = bit | 1 << x
            ndp[nbit] = (ndp[nbit] + ndp[bit] * A[y][x]) % mod
            ndp[nbit] = (ndp[nbit] + dp[bit] * A[y][x]) % mod
    dp = ndp
print(dp[-1])