#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<queue>
#include<stack>
#include<map>
#include<vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
const int maxn=1e5+10;
const int maxm=1e6+10;
const ll mod=2147483648;
const int base=1e8;
const ull base1=233;
const ull base2=19260817;
const int maxxn=0x7fffffff;
const int minxn=-0x7fffffff;
const db inf=1e13;
const db eps=1e-8;
inline ll read(){
    ll x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}
int n,m,w,k;
int x[maxn],y[maxn];
int fac[maxn][15],cnt[maxn][2];
pair<int,int> p[maxn];
struct BIT{
    int num[maxn];
    inline int lowbit(int x){
        return x&(-x);
    }
    inline void update(int x,int k){
        k%=mod;
        while(x<=w){
            num[x]=(num[x]+k)%mod;
            x+=lowbit(x);
        }
    }
    inline int query(int x){
        int res=0;
        while(x){
            res=(res+num[x])%mod;
            x-=lowbit(x);
        }
        return res;
    }
}tree;
int ans;
int cntw[maxn];
int main(){
    n=read(),m=read(),w=read();
    for(int i=1;i<=w;i++){
        p[i].first=x[i]=read(),p[i].second=y[i]=read();
    }
    k=read();
    fac[0][0]=1;
    for(int i=1;i<=w;i++){
        fac[i][0]=1;
        for(int j=1;j<=k;j++){
            fac[i][j]=(fac[i-1][j-1]+fac[i-1][j])%mod;
        }
    }
    sort(x+1,x+w+1);
    sort(y+1,y+w+1);
    for(int i=1;i<=w;i++){
        p[i].first=lower_bound(x+1,x+w+1,p[i].first)-x;
        p[i].second=lower_bound(y+1,y+w+1,p[i].second)-y;
        cnt[p[i].first][0]++,cnt[p[i].second][1]++;
    }
    sort(p+1,p+w+1);
    int cntn,cnts=1;
    for(int i=1;i<w;i++){
        if(p[i].first==p[i-1].first) cnts++;
        else cnts=1;
        cntn=cnt[p[i].first][0]-cnts;
        if(cntn){
            int num=(tree.query(p[i+1].second-1)-tree.query(p[i].second)%mod+mod)%mod;
            ans=(ans+fac[cntn][k]*fac[cnts][k]%mod*num)%mod;
        }
        cntw[p[i].second]++;
        int num1=fac[cntw[p[i].second]][k]*fac[cnt[p[i].second][1]-cntw[p[i].second]][k]%mod;
        int num2=(tree.query(p[i].second)-tree.query(p[i].second-1)%mod+mod)%mod;
        tree.update(p[i].second,((num1-num2)%mod+mod)%mod);
    }
    printf("%lld\n",(ans%mod+mod)%mod);
    return 0;
}