Problem: A dam construction project was designed around an area called Black Force. The area is surrounded by mountains and its rugged terrain is said to be very suitable for constructing a dam.

However, the project is now almost pushed into cancellation by a strong protest campaign started by the local residents. Your task is to plan out a compromise proposal. In other words, you must find a way to build a dam with sufficient capacity, without destroying the inhabited area of the residents.

The map of Black Force is given as H × W cells (0 < H, W ≤ 20). Each cell hi, j is a positive integer representing the height of the place. The dam can be constructed at a connected region surrounded by higher cells, as long as the region contains neither the outermost cells nor the inhabited area of the residents. Here, a region is said to be connected if one can go between any pair of cells in the region by following a sequence of left-, right-, top-, or bottom-adjacent cells without leaving the region. The constructed dam can store water up to the height of the lowest surrounding cell. The capacity of the dam is the maximum volume of water it can store. Water of the depth of 1 poured to a single cell has the volume of 1.

The important thing is that, in the case it is difficult to build a sufficient large dam, it is allowed to choose (at most) one cell and do groundwork to increase the height of the cell by 1 unit. Unfortunately, considering the protest campaign, groundwork of larger scale is impossible. Needless to say, you cannot do the groundwork at the inhabited cell.

Given the map, the required capacity, and the list of cells inhabited, please determine whether it is possible to construct a dam.



Input

The input consists of multiple data sets. Each data set is given in the following format:


H W C R
h1,1 h1,2 . . . h1,W
...
hH,1 hH,2 . . . hH,W
y1 x1
...
yR xR


H and W is the size of the map.  is the required capacity. R (0 < R < H × W) is the number of cells inhabited. The following H lines represent the map, where each line contains W numbers separated by space. Then, the R lines containing the coordinates of inhabited cells follow. The line “y x” means that the cell hy,x is inhabited.

The end of input is indicated by a line “0 0 0 0”. This line should not be processed.

Output

For each data set, print “Yes” if it is possible to construct a dam with capacity equal to or more than C. Otherwise, print “No”.

Example

Input

4 4 1 1
2 2 2 2
2 1 1 2
2 1 1 2
2 1 2 2
1 1
4 4 1 1
2 2 2 2
2 1 1 2
2 1 1 2
2 1 2 2
2 2
4 4 1 1
2 2 2 2
2 1 1 2
2 1 1 2
2 1 1 2
1 1
3 6 6 1
1 6 7 1 7 1
5 1 2 8 1 6
1 4 3 1 5 1
1 4
5 6 21 1
1 3 3 3 3 1
3 1 1 1 1 3
3 1 1 3 2 2
3 1 1 1 1 3
1 3 3 3 3 1
3 4
0 0 0 0


Output

Yes
No
No
No
Yes

Solution (in CPP):

Solution:
#include<cstdio>
#include<vector>
#include<algorithm>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

int h,w,capa,a[20][20];
bool live[20][20];

bool check(int wall){ // 壁の高さの最小値
	bool vis[20][20]={};
	rep(i,h) rep(j,w) if(!vis[i][j] && a[i][j]<wall) {
		vis[i][j]=true;

		int sum=0;
		bool ok=true;
		int Q[20*20],head=0,tail=0;
		Q[tail++]=i*w+j;
		while(head<tail){
			int y=Q[head]/w,x=Q[head]%w; head++;

			if(live[y][x] || y==0 || y==h-1 || x==0 || x==w-1) ok=false;
			sum+=wall-a[y][x];

			rep(k,4){
				int yy=y+dy[k],xx=x+dx[k];
				if(0<=yy && yy<h && 0<=xx && xx<w && !vis[yy][xx] && a[yy][xx]<wall){
					vis[yy][xx]=true;
					Q[tail++]=yy*w+xx;
				}
			}
		}

		if(ok && sum>=capa) return true;
	}

	return false;
}

int main(){
	for(int m;scanf("%d%d%d%d",&h,&w,&capa,&m),h;){
		rep(i,h) rep(j,w) {
			scanf("%d",a[i]+j);
			live[i][j]=false;
		}
		rep(i,m){
			int y,x; scanf("%d%d",&y,&x); y--; x--;
			live[y][x]=true;
		}

		vector<int> as;
		rep(i,h) rep(j,w) {
			as.push_back(a[i][j]);
			as.push_back(a[i][j]+1);
		}
		sort(as.begin(),as.end());
		as.erase(unique(as.begin(),as.end()),as.end());

		rep(i,as.size()){
			if(check(as[i])) goto FOUND;
			rep(y,h) rep(x,w) if(!live[y][x]) {
				a[y][x]++;
				if(check(as[i])) goto FOUND;
				a[y][x]--;
			}
		}

		puts("No");
		continue;

		FOUND:
		puts("Yes");
	}

	return 0;
}