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

#include<atcoder/all>
using namespace atcoder;
using mint=atcoder::modint998244353;

#define int long long

#define rep(i,n) for(int i=0;i<(n);i++)
#define rng(i,l,r) for(int i=(l);i<(r);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrng(i,l,r) for(int i=(r)-1;i>=(l);i--)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second

struct fast_io{fast_io(){cin.tie(nullptr)->sync_with_stdio(false);}}_;
template<class T> bool chmax(T &a,T b){return (a<b)?a=b,1:0;}
template<class T> bool chmin(T &a,T b){return (a>b)?a=b,1:0;}

template<class T>using pqmin=priority_queue<T,vector<T>,greater<T>>;

namespace nouka28{
    template<class T>
    vector<T> ZetaTransform(int n,vector<T> f){
        for(int i=0;i<n;i++){
            for(int j=0;j<(1<<n);j++){
                if(j>>i&1)f[j]+=f[j^(1<<i)];
            }
        }
        return f;
    }
    template<class T>
    vector<T> MobiusTransform(int n,vector<T> f){
        for(int i=0;i<n;i++){
            for(int j=0;j<(1<<n);j++){
                if(j>>i&1)f[j]-=f[j^(1<<i)];
            }
        }
        return f;
    }
    template<class T>
    vector<T> convolution_or(vector<T> f,vector<T> g){
        int x=1,n=0;while(x<max((int)f.size(),(int)g.size()))x<<=1,n++;
        f.resize(x);g.resize(x);
        f=ZetaTransform(n,f);g=ZetaTransform(n,g);
        vector<T> h;for(int i=0;i<x;i++)h.push_back(f[i]*g[i]);
        return MobiusTransform(n,h);
    }
    template<class T>
    vector<T> convolution_and(vector<T> f,vector<T> g){
        int x=1,n=0;while(x<max((int)f.size(),(int)g.size()))x<<=1,n++;
        f.resize(x);g.resize(x);
        reverse(f.begin(),f.end());reverse(g.begin(),g.end());
        vector<T> h=convolution_or(f,g);
        reverse(h.begin(),h.end());
        return h;
    }
}
using namespace nouka28;

signed main(){
	int N,M,L;cin>>N>>M>>L;
	vector<vector<int>> C(M,vector<int>(L));
	rep(i,N){
		int a,b;cin>>a>>b;
		a--;
		b-=M+1;
		C[a][b]++;
	}


	vector<vector<mint>> F(M,vector<mint>(L));
	rep(i,M)rep(j,L){
		F[i][j]=mint(2).pow(C[i][j])-1;
	}

	vector<mint> ret(1<<L);
	ret[0]=1;

	rep(i,M){
		vector<mint> f(1<<L);
		rng(S,1,1<<L){
			mint x=1;
			rep(j,L)if(S>>j&1)x*=F[i][j];
			f[S]=x;
		}
		// cout<<i<<" : ";
		// for(auto&&e:f)cout<<e.val()<<" ";
		// cout<<endl;
		ret=nouka28::convolution_or(ret,f);
	}

	cout<<ret.back().val()<<"\n";
}