#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

const int N = 100005, S = 11;

typedef long long LL;

const LL P = 2147483648ll;

int n, m, w, K, dx[N], dy[N], tx, ty, C[N][S];
int cx[N], cy[N], now[N], c[N];

int ans;

struct Node{
	int x, y;
	bool operator < (const Node &b) const {
		return x == b.x ? y < b.y : x < b.x;
	}
} e[N];

int get(int a, int b) {
	if (a >= K && b >= K) return (LL)C[a][K] * C[b][K] % P;
	else return 0;
}

void inline add(int x, int k) {
	for (; x <= ty; x += x & -x)
		c[x] = ((LL)c[x] + k) % P;
}

int inline ask(int x) {
	LL res = 0;
	for (; x; x -= x & -x) (res += c[x]) %= P;
	return res;
}

int main() {
	scanf("%d%d%d", &n, &m, &w);
	for (int i = 1; i <= w; i++) {
		scanf("%d%d", &e[i].x, &e[i].y);
		dx[++tx] = e[i].x;
		dy[++ty] = e[i].y;
	}
	scanf("%d", &K);
	C[0][0] = 1;
	for (int i = 1; i <= w; i++) {
		C[i][0] = 1;
		for (int j = 1; j <= min(i, K); j++)
			C[i][j] = ((LL)C[i - 1][j] + C[i - 1][j - 1]) % P;
	}
	sort(e + 1, e + 1 + w);
	sort(dx + 1, dx + 1 + tx);
	tx = unique(dx + 1, dx + 1 + tx) - dx - 1;
	sort(dy + 1, dy + 1 + ty);
	ty = unique(dy + 1, dy + 1 + ty) - dy - 1;
	for (int i = 1; i <= w; i++) {
		e[i].x = lower_bound(dx + 1, dx + 1 + tx, e[i].x) - dx;
		e[i].y = lower_bound(dy + 1, dy + 1 + ty, e[i].y) - dy;
		cx[e[i].x] ++, cy[e[i].y]++;
	}
	for (int i = 1, j = 1; i <= tx; i++) {
		int t = 0, s = cx[i];
		while (j <= w && e[j].x == i) {
			++t;
			if (e[j + 1].x == i && t >= K && s - t >= K) {
				ans = (ans + (LL)C[t][K] * C[s - t][K] % P * ((LL)ask(e[j + 1].y - 1) - ask(e[j].y) + P)) % P;	
			}
			int y = e[j].y;
			add(e[j].y, ((LL)get(now[y] + 1, cy[y] - now[y] - 1) - get(now[y], cy[y] - now[y]) + P) % P);
			now[y]++;
			++j;
		}
	}
	printf("%d\n", ans);
	return 0;
}