#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

const ll mod = 998244353;

vector<ll> fzt(vector<ll> &vec, ll N){
    vector<ll> ret(1 << N);
    for (ll i = 0; i < (1 << N); i++){
        ret[i] = vec[i];
    }
    for (ll i = 0; i < N; i++){
        for (ll j = 0; j < (1 << N); j++){
            if (!((j >> i) & 1)){
                ret[j + (1 << i)] = (ret[j + (1 << i)] + ret[j]) % mod;
            }
        }
    }
    return ret;
}

vector<ll> fmt(vector<ll> &vec, ll N){
    vector<ll> ret(1 << N);
    for (ll i = 0; i < (1 << N); i++){
        ret[i] = vec[i];
    }
    for (ll i = 0; i < N; i++){
        for (ll j = 0; j < (1 << N); j++){
            if ((j >> i) & 1){
                ret[j] = (ret[j] + mod - ret[j - (1 << i)]) % mod;
            }
        }
    }
    return ret;
}

vector<ll> or_convolution(vector<ll> &f, vector<ll> &g, ll N){
    vector<ll> fw = fzt(f, N);
    vector<ll> gw = fzt(g, N);
    vector<ll> hw(1 << N);
    for (ll i = 0; i < (1 << N); i++){
        hw[i] = (fw[i] * gw[i]) % mod;
    }
    vector<ll> h = fmt(hw, N);
    return h;
}

int main(){
    ll N, M, L;
    cin >> N >> M >> L;

    vector<ll> A(N);
    vector<ll> B(N);
    for (ll i = 0; i < N; i++){
        cin >> A[i] >> B[i];
        A[i]--;
        B[i] -= (M + 1);
    }

    vector<ll> pow_2(N + 1);
    pow_2[0] = 1;
    for (ll i = 0; i < N; i++){
        pow_2[i + 1] = (pow_2[i] * 2LL) % mod;
    }
    vector<vector<ll>> cnts(M, vector<ll>(L, 0));
    for (ll i = 0; i < N; i++){
        cnts[A[i]][B[i]]++;
    }

    vector<ll> ans_vec(1 << L, 0);
    ans_vec[0] = 1;
    for (ll i = 0; i < M; i++){
        vector<ll> g_vec(1 << L, 0);
        for (ll j = 1; j < (1 << L); j++){
            ll sub = 1;
            for (ll k = 0; k < L; k++){
                if ((j >> k) & 1){
                    sub = (sub * (pow_2[cnts[i][k]] + mod - 1)) % mod;
                }
            }
            g_vec[j] = sub;
        }
        vector<ll> ans_vec_new = or_convolution(ans_vec, g_vec, L);
        ans_vec = ans_vec_new;
    }
    cout << ans_vec[(1 << L) - 1] << endl;
}