#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool f[105][105];
ll a[105][105];
int main() {
    int n,m,k,p,s;
    cin>>n>>m>>k>>p>>s;
    if(s)
    {
	    for(int i=1;i<=s;i++)
	    {
	    	int x,y;
	    	cin>>x>>y;
	    	f[x][y] = 1;
		}
	}
	a[1][1] = 1;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
		{
			if(!f[i][j]&&!a[i][j])
				a[i][j] = (a[i-1][j] + a[i][j-1])%p;
		}
	if(k==0)
		cout<<a[n][m];
	else
		cout<<a[n][m]*(n+m-1)%p;
    return 0;
}