/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
const int N = 1e3+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
ll n, m, k, t, ans;
ll z;
ll dp[N][N], h[N][N];
void solve(){
fastios
cin>>n>>m>>k>>t>>z;
vector<pll> vv(k);
for(int i=0;i<k;i++) { cin>>vv[i].ff>>vv[i].ss; h[vv[i].ff][vv[i].ss] = 1; }
dp[0][0] = 1;
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
if(i) dp[i][j] += dp[i-1][j], dp[i][j] %= z, h[i][j] += h[i-1][j];
if(j) dp[i][j] += dp[i][j-1], dp[i][j] %= z, h[i][j] += h[i][j-1];
}
}
ans = dp[n][m];
sort(all(vv));
for(ll i=t; i<k; i++) ans -= h[vv[i].ff][vv[i].ss];
cout<<ans<<" "<<"\n";
return;
}
/*
4 4 5 3 1000000
0 1
0 3
2 1
2 3
4 3
*/
int main(){
fastios
int t = 1;
if(t) solve();
else {
cin>>t;
while (t--) solve();
}
return 0;
}
