#include<bits/stdc++.h>
using namespace std;
const int N = 150;
int a[N][N],b[N][N];
int main()
{
int n, m; cin >> n >> m;
int t;cin >> t;
for(int i = 1; i <= t; i++)
{
int r, c;
cin >> r >> c;
a[r][c] = 1;
}
int k;cin >> k;//k分钟
for(int i = 1; i <= k; i++)
{
for(int j = 1; j <= n;j++)
{
for(int z = 1; z <= m; z++)
{
if(a[j][z] == 1)
{
b[j][z] = 1;
b[j-1][z] = 1;
b[j+1][z] = 1;
b[j][z-1] = 1;
b[j][z+1] = 1;
}
}
}
//把b复制给a 保证是前一分钟的结果
for(int j = 1; j <= n;j++)
for(int z = 1; z <= m; z++) a[j][z] = b[j][z];
}
int ans = 0;
for(int j = 1; j <= n;j++)
{
for(int z = 1; z <= m; z++)
{
if(a[j][z] == 1)
{
ans++;
}
}
}
cout << ans << '\n';
return 0;
}