#include<iostream>
#include<algorithm>
using namespace std;
#define int long long
int n,m,k,t,MOD;
int put(int a, int exp)
{
if(exp==0)
return 1;
if(exp%2==0)
return put((a*a)%MOD,exp/2);
else
return (put((a*a)%MOD,exp/2)*a)%MOD;
}
pair<int,int> traps[25];
int dp[1100000];
int ult[1100000];
int fact[6000015];
int invf[6000015];
int comb(int x, int y)
{
int prod=1;
for(int i=1;i<=x;i++)
prod = prod * i;
for(int i=1;i<=y;i++)
prod = prod/i;
for(int i=1;i<=x-y;i++)
prod = prod/i;
return prod%MOD;
return (((((fact[x]*put(fact[y],MOD-2))%MOD)*put(fact[x-y],MOD-2))))%MOD;
}
signed main()
{
cin>>n>>m>>k>>t>>MOD;
fact[0]=1;
for(int i=1;i<=n+m;i++)
fact[i] = (fact[i-1]*i)%MOD;
invf[n+m] = put(fact[n+m],MOD-2);
for(int i=n+m-1;i>=0;i--)
invf[i]=(invf[i+1]*(i+1))%MOD;
for(int i=0;i<k;i++)
{
cin>>traps[i].first>>traps[i].second;
}
sort(traps,traps+k);
int rez=comb(n+m,n);
for(int config=1;config<(1<<k);config++)
{
int cnt=0;
for(int i=0;i<k;i++)
if(((1<<i)&config))
cnt++;
for(int i=0;i<k;i++)
{
if(((1<<i)&config) && (cnt==1 || (traps[ult[config-(1<<i)]].first <= traps[i].first && traps[ult[config-(1<<i)]].second <= traps[i].second)))
{
ult[config]=i;
if(cnt>1)
{
int j = ult[config-(1<<i)];
dp[config] = (dp[config-(1<<i)] * comb((traps[i].first - traps[j].first) + (traps[i].second - traps[j].second), (traps[i].second - traps[j].second)))%MOD;
}
else
dp[config] = comb(traps[i].first + traps[i].second, traps[i].first);
if(cnt%2==0 && cnt>t)
rez += (dp[config] * comb(n - traps[i].first + m - traps[i].second, n - traps[i].first))%MOD;
else if(cnt>t)
rez = rez + MOD - (dp[config] * comb(n - traps[i].first + m - traps[i].second, n - traps[i].first))%MOD;
rez%=MOD;
break;
}
}
}
cout<<rez;
return 0;
}
