#include<iostream>#include<stdio.h>#include<stdlib.h>#include<math.h>#include<memory.h>using namespace std;const int inf=1<<30;const int MAX=505;struct node{int v,c,next;}g[MAX*MAX*2];int dis[MAX],num[MAX],cur[MAX],pre[MAX],adj[MAX],map[MAX][MAX];int s,t,e,vn;void add(int u,int v,int c){g[e].v=v; g[e].c=c; g[e].next=adj[u]; adj[u]=e++;g[e].v=u; g[e].c=0; g[e].next=adj[v]; adj[v]=e++;}int ABS(int x){return x>0?x:-x;}int sap(){int i,u,v,flow=0,aug=inf,flag;for(i=0;i<=vn;i++){dis[i]=num[i]=0;cur[i]=adj[i];}num[0]=vn;pre[s]=u=s;while(dis[s]<vn){flag=0;for(i=cur[u];i!=-1;i=g[i].next){v=g[i].v;if(g[i].c&&dis[u]==dis[v]+1){flag=1;pre[v]=u;cur[u]=i;aug=aug<g[i].c?aug:g[i].c;u=v;if(u==t){flow+=aug;while(u!=s){u=pre[u];g[cur[u]].c-=aug;g[cur[u]^1].c+=aug;}aug=inf;}break;}}if(flag)continue;if(--num[dis[u]]==0)break;for(dis[u]=vn,i=adj[u];i!=-1;i=g[i].next){v=g[i].v;if(g[i].c&&dis[v]<dis[u]){dis[u]=dis[v];cur[u]=i;}}dis[u]++;num[dis[u]]++;u=pre[u];}return flow;}int main(){int i,j,k,T,ca,v0,v1,r,col;scanf("%d",&T);for(ca=1;ca<=T;ca++){scanf("%d %d %d %d",&r,&col,&v0,&v1);e=0;memset(adj,-1,sizeof(adj));memset(map,0,sizeof(map));s=0;t=r*col+1;vn=t+1;for(i=1;i<=r;i++){for(j=1;j<=col;j++){scanf("%d",&map[i][j]);}}for(i=1;i<=r;i++){for(j=1;j<=col;j++){k=(i-1)*col+j;add(s,k,ABS(map[i][j]-v0));add(k,s,ABS(map[i][j]-v0));add(k,t,ABS(map[i][j]-v1));add(t,k,ABS(map[i][j]-v1));if(i<r){add(k,k+col,ABS(map[i][j]-map[i+1][j]));add(k+col,k,ABS(map[i][j]-map[i+1][j]));}if(j<col){add(k,k+1,ABS(map[i][j]-map[i][j+1]));add(k+1,k,ABS(map[i][j]-map[i][j+1]));}}}printf("Case %d:n",ca);printf("%dn",sap());if(ca<T)printf("n");}return 0;}
