#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }
#ifdef _MSC_VER
#define __builtin_popcount (int)__popcnt
#define __builtin_popcountll (int)__popcnt64
inline int __builtin_ctz(unsigned int n) { unsigned long i; _BitScanForward(&i, n); return i; }
inline int __builtin_ctzll(unsigned long long n) { unsigned long i; _BitScanForward64(&i, n); return i; }
inline int __builtin_clz(unsigned int n) { unsigned long i; _BitScanReverse(&i, n); return i; }
inline int __builtin_clzll(unsigned long long n) { unsigned long i; _BitScanReverse64(&i, n); return i; }
#endif
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, m, l;
	cin >> n >> m >> l;
	vector<int> a(n), b(n);
	rep(i, n) {
		cin >> a[i] >> b[i];
		a[i]--;
		b[i] -= m + 1;
	}

	vector<int> freqA(m, 0), freqB(l, 0);
	vector<vector<int>> c(m, vector<int>(l, 0));
	rep(i, n) {
		freqA[a[i]]++;
		freqB[b[i]]++;
		c[a[i]][b[i]]++;
	}
	int bit = 1 << m;
	vector<int>suma(bit);
	rep2(i, 1, bit) {
		int j = __builtin_ctz(i);
		suma[i] = suma[i ^ (1 << j)] + freqA[j];
	}
	mint ans = 0;
	rep(i, bit) {
		int pc = __builtin_popcount(i);
		vector<int> t(l);
		rep(j, m)if (1 & (i >> j)) {
			rep(k, l) t[k] += c[j][k];
		}
		mint val = pow_mod(2, n - suma[i], mod);
		rep(j, l) {
			mint tmp = mint(1) - mint(2).pow(t[j]) / mint(2).pow(freqB[j]);
			val *= tmp;
		}
		if (pc % 2)ans -= val;
		else ans += val;
	}
	cout << ans.val() << endl;
	return 0;
}