#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=998244353;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
vi fac,finv,inv;
void init(ll n){
    n*=3;
    fac=vi(n+5);finv=vi(n+5);inv=vi(n+5);
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    REP(i,2,n+5){
        fac[i]=fac[i-1]*i%mod;
        inv[i]=mod-inv[mod%i]*(mod/i)%mod;
        finv[i]=finv[i-1]*inv[i]%mod;
    }
}
long long modcom(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main(){
    ll n,m,l,k;cin>>n>>m>>l>>k;init(n);
    assert(1<=n&&n<=200000);
    assert(0<=m&&m<=100000&&m<=n-1);
    assert(0<=l&&l<=100&&l<=(n+1)*(n+1));
    assert(0<=k&&k<=100000);
    vp v(m+2);v[0]=P(0,0);v[m+1]=P(n,n);
    rep(i,m){
        cin>>v[i+1].fi>>v[i+1].se;
        assert(0<v[i+1].fi&&v[i+1].fi<n);
        assert(0<v[i+1].se&&v[i+1].se<n);
        assert(v[i+1].fi>v[i].fi);
        assert(v[i+1].se>v[i].se);
    }
    vvp tiger(m+1);
    map<P,ll> mp;
    ll cnt=l;
    rep(i,l){
        ll x,y;cin>>x>>y;
        assert(0<=x&&x<=n);
        assert(0<=y&&y<=n);
        assert(P(x,y)!=P(0,0));
        assert(P(x,y)!=P(n,n));
        assert(!mp.count(P(x,y)));
        mp[P(x,y)]=0;
        ll t=lb(v,P(x,y));
        if(v[t].se<=y&&y<=v[t+1].se)tiger[t].pb(x,y);
        else cnt--;
    }
    l=cnt;
    if(k>=l){
        ll ans=1;
        rep(i,m+1){
            ans*=modcom(v[i+1].fi-v[i].fi+v[i+1].se-v[i].se,v[i+1].fi-v[i].fi);
            ans%=mod;
        }
        out(ans);
    }
    else assert(false);
}