#include <bits/stdc++.h>
using namespace std;
#define file ""
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
return l + rd() % (r - l + 1);
}
const int N = 1e3 + 5;
/*const*/ int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;
template<class X, class Y> bool mini(X &a, Y b) {
return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
a += b;
if (a >= mod) a -= mod;
if (a < 0) a += mod;
}
int m, n, k, turn;
int f[N][N][25];
int block[N][N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// freopen(file".inp", "r", stdin);
// freopen(file".out", "w", stdout);
cin >> m >> n >> k >> turn >> mod;
for (int i = 1; i <= k; ++i) {
int x, y;
cin >> x >> y;
block[x][y] = true;
}
f[0][0][turn] = 1;
for (int i = 0; i <= m; ++i) for (int j = 0; j <= n; ++j) for (int t = 0; t <= turn; ++t) {
add(f[i][j + 1][t - block[i][j]], f[i][j][t]);
add(f[i + 1][j][t - block[i][j]], f[i][j][t]);
}
int res = 0;
for (int i = 0; i <= turn; ++i) add(res, f[m][n][i]);
cout << res;
return 0;
}
/*
*/
