#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long modpow(long long a, long long b){
  long long ans = 1;
  while (b > 0){
    if (b % 2 == 1){
      ans *= a;
      ans %= MOD;
    }
    a *= a;
    a %= MOD;
    b /= 2;
  }
  return ans;
}
long long modinv(long long a){
  return modpow(a, MOD - 2);
}
int main(){
  int N, M, L, K;
  cin >> N >> M >> L >> K;
  vector<int> xc(M + 2), yc(M + 2);
  xc[0] = 0;
  yc[0] = 0;
  for (int i = 1; i <= M; i++){
    cin >> xc[i] >> yc[i];
  }
  xc[M + 1] = N;
  yc[M + 1] = N;
  vector<int> xt(L), yt(L);
  for (int i = 0; i < L; i++){
    cin >> xt[i] >> yt[i];
    for (int j = 1; j <= M; j++){
      if (xt[i] == xc[j] && yt[i] == yc[j]){
        K--;
        xt[i] = -1;
        yt[i] = -1;
      }
    }
  }
  if (K < 0){
    cout << 0 << endl;
    return 0;
  }
  K = min(K, L);
  vector<long long> fact(N * 2 + 1, 1);
  for (int i = 1; i <= N * 2; i++){
    fact[i] = fact[i - 1] * i % MOD;
  }
  vector<long long> finv(N * 2 + 1);
  finv[N * 2] = modinv(fact[N * 2]);
  for (int i = N * 2; i >= 1; i--){
    finv[i - 1] = finv[i] * i % MOD;
  }
  vector<vector<long long>> dp(M + 2, vector<long long>(K + 1, 0));
  dp[0][0] = 1;
  for (int i = 0; i <= M; i++){
    int x = xc[i + 1] - xc[i];
    int y = yc[i + 1] - yc[i];
    vector<pair<int, int>> t;
    t.push_back(make_pair(0, 0));
    for (int j = 0; j < L; j++){
      if (xc[i] <= xt[j] && xt[j] <= xc[i + 1] && yc[i] <= yt[j] && yt[j] <= yc[i + 1]){
        t.push_back(make_pair(xt[j] - xc[i], yt[j] - yc[i]));
      }
    }
    t.push_back(make_pair(x, y));
    sort(t.begin(), t.end());
    int T = t.size();
    vector<vector<long long>> cnt(T, vector<long long>(T, 0));
    for (int j = 0; j < T; j++){
      for (int k = j + 1; k < T; k++){
        int dx = t[k].first - t[j].first;
        int dy = t[k].second - t[j].second;
        if (dx >= 0 && dy >= 0){
          cnt[j][k] = fact[dx + dy] * finv[dx] % MOD * finv[dy] % MOD;
          for (int l = j + 1; l < k; l++){
            int dx2 = t[k].first - t[l].first;
            int dy2 = t[k].second - t[l].second;
            if (dx2 >= 0 && dy2 >= 0){
              cnt[j][k] += MOD - cnt[j][l] * fact[dx2 + dy2] % MOD * finv[dx2] % MOD * finv[dy2] % MOD;
            }
          }
          cnt[j][k] %= MOD;
        }
      }
    }
    vector<vector<long long>> dp2(T, vector<long long>(T, 0));
    dp2[0][0] = 1;
    for (int j = 0; j < T; j++){
      for (int k = j + 1; k < T; k++){
        for (int l = 0; l < T - 1; l++){
          dp2[k][l + 1] += dp2[j][l] * cnt[j][k] % MOD;
        }
      }
    }
    for (int j = 0; j <= K; j++){
      for (int k = 1; k < T; k++){
        if (j + k - 1 <= K){
          dp[i + 1][j + k - 1] += dp[i][j] * dp2[T - 1][k] % MOD;
          dp[i + 1][j + k - 1] %= MOD;
        }
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i <= K; i++){
    ans += dp[M + 1][i];
  }
  ans %= MOD;
  cout << ans << endl;
}