/**
	author:  shobonvip
	created: 2026.03.27 21:19:59
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, m, l;
	cin >> n >> m >> l;
	vector<int> a(n), b(n);
	vector dp(m, vector<int>(1<<l));
	rep(i,0,n) {
		cin >> a[i] >> b[i];
		a[i]--;
		b[i] -= m;
		b[i]--;
		dp[a[i]][1<<b[i]]+=1;
	}
	vector<mint> pow2(n+1);
	pow2[0]=1;
	rep(i,0,n) pow2[i+1]=pow2[i]*2;

	vector<mint> ans(1<<l,1);

	rep(i,0,m) {
		vector<mint> dvp(1<<l);
		rep(k,0,l) {
			rep(j,0,1<<l) {
				if (j>>k&1) {
					dp[i][j] += dp[i][j^(1<<k)];
				}
			}
		}
		rep(j,0,1<<l) {
			dvp[j]=pow2[dp[i][j]]-1;
		}
		rep(j,0,1<<l) {
			ans[j]*=dvp[j];
		}

	}

	rep(i,0,l) {
		rrep(j,0,1<<l) {
			if (j>>i&1) {
				ans[j] -= ans[j^(1<<i)];
			}
		}
	}
	cout << ans[(1<<l)-1].val() << '\n';
}