#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

const ll MOD = 998244353;

class ModInt{
    public:
    ll v;
    ModInt(ll _v = 0){
        if(_v < 0) _v = (v%MOD)+MOD;
        if(_v >= MOD) _v %= MOD;
        v = _v;
    }
    ModInt operator+(ll n){
        return ModInt((v+n)%MOD);
    }
    ModInt operator-(ll n){
        return ModInt((v-n+MOD)%MOD);
    }
    ModInt operator*(ll n){
        if(n >= MOD) n %= MOD;
        return ModInt((v*n)%MOD);
    }
    ModInt operator/(ll n){
        return ModInt((ModInt(n).inv()*v).v%MOD);
    }

    void operator+=(ll n){
        v = (v+n)%MOD;
    }
    void operator-=(ll n){
        v = (v-n+MOD)%MOD;
    }
    void operator*=(ll n){
        v = (v*n+MOD)%MOD;
    }
    
    
    ModInt operator+(ModInt n){
        return ModInt((v+n.v)%MOD);
    }
    ModInt operator-(ModInt n){
        return ModInt((v-n.v+MOD)%MOD);
    }
    ModInt operator*(ModInt n){
        return ModInt((v*n.v)%MOD);
    }
    ModInt operator/(ModInt n){
        return ModInt((n.inv()*v).v%MOD);
    }

    void operator+=(ModInt n){
        v = (v+n.v)%MOD;
    }
    void operator-=(ModInt n){
        v = (v-n.v+MOD)%MOD;
    }
    void operator*=(ModInt n){
        v = (v*n.v)%MOD;
    }

    void operator=(ModInt n){
        v = n.v;
    }
    bool operator==(ModInt n){
        return v == n.v;
    }
    bool operator!=(ModInt n){
        return v != n.v;
    }
    void operator=(ll n){
        v = n%MOD;
    }

    ModInt inv(){
        if(v == 1) return ModInt(1);
        else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD);
    }
};

ostream& operator<<(ostream& os, const ModInt& m){
    os << m.v;
    return os;
}

istream & operator >> (istream &in,  ModInt &m){
    in >> m.v;
    return in;
}

ModInt pow(ModInt a, ll n) {
    assert(n >= 0);
	ModInt ans = 1;
	ModInt tmp = a;
	for (int i = 0; i <= 60; i++) {
		ll m = (ll)1 << i;
		if (m & n) {
		ans *= tmp;
		}
		tmp *= tmp;
	}
	return ans;
}

#define N_MAX 400002
ModInt inv[N_MAX],fac[N_MAX],finv[N_MAX];

void init(){
    fac[0]=1;fac[1]=1;
    finv[0]=1;finv[1]=1;
    inv[1]=1;
    for(int i=2;i<N_MAX;i++){
        inv[i]=ModInt(MOD)-inv[MOD%i]*(MOD/i);
        fac[i]=fac[i-1]*(ll) i;
        finv[i]=finv[i-1]*inv[i];
    }
}

ModInt comb(ll n, ll r){
    if(n < r){
        return ModInt(0);
    }else{
        return fac[n]*finv[r]*finv[n-r];
    }
}

using mint = ModInt;
using P = pair<int, int>;

vector<mint> calc(vector<P> vp){
    int n = vp.size();
    vector<vector<mint>> dp(n, vector<mint>(n+1));
    dp[0][0] = 1;
    for(int i = 0; i < n; i++){
        auto [x1, y1] = vp[i]; 
        for(int k = 1; k <= i; k++) dp[i][k] -= dp[i][k+1];
        for(int j = i+1; j < n; j++){
            auto [x2, y2] = vp[j];
            if(x1 > x2 || y1 > y2) continue;
            for(int k = 0; k <= i; k++){
                dp[j][k+1] += dp[i][k]*comb(y2+x2-y1-x1, y2-y1);
            }
        }
    }
    vector<mint> v(n-1);
    for(int i = 0; i < n-1; i++) {
        v[i] = dp[n-1][i+1];
    }
    return v;
}

vector<mint> convolute(vector<mint> u, vector<mint> v){
    int n = u.size(), m = v.size();
    vector<mint> ans(n+m-1);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            ans[i+j] += u[i]*v[j];
        }
    }
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    init();
    int n, m, l, k; cin >> n >> m >> l >> k;
    vector<P> cp(m+2);
    set<P> used;
    cp[0] = P(0, 0);
    cp[m+1] = P(n, n);
    for(int i = 0; i < m; i++){
        int x, y; cin >> x >> y;
        cp[i+1] = P(x, y);
        used.insert(P(x,  y));
    }

    vector<P> tp;
    for(int i = 0; i < l; i++){
        int x, y; cin >> x >> y;
        if(used.count(P(x, y))) {
            k--;
            continue;
        }
        tp.push_back(P(x, y));
    }
    sort(tp.begin(), tp.end());

    vector<mint> ans = {mint(1)};

    for(int i = 0; i <= m; i++){
        auto [xs, ys] = cp[i];
        auto [xt, yt] = cp[i+1];
        vector<P> vp;
        vp.push_back(cp[i]);
        for(auto [x, y]: tp){
            if(xs <= x && x <= xt && ys <= y && y <= yt) vp.push_back(P(x, y));
        }
        vp.push_back(cp[i+1]);
        auto v = calc(vp);
        ans = convolute(ans, v);
    }

    mint sum = 0;
    for(int i = 0; i <= k && i < (int)ans.size(); i++) {
        sum += ans[i];
    }
    cout << sum << endl;
}