#include <iostream>
#define MAX 31
 
using namespace std;
 
typedef struct
{
	int x,y;
}point;
 
class tQueue
{
public:
	class linklist
	{
	public:
		linklist* next;
		point value;
		linklist()
		{
			next=0;
		}
	};
	linklist *first,*last;
	int size;
	void add(point p)
	{
		if (size==0)
			first=last=new linklist;
		else
			last=last->next=new linklist;
		last->value=p;
		size++;
	}
	point del()
	{
		point rtn=first->value;
		linklist *tfirst=first;
		first=first->next;
		delete tfirst;
		size--;
		return rtn;
	}
	void reset()
	{
		size=0;
		first=last=0;
	}
	tQueue()
	{
		reset();
	}
};
 
int N,M,X,Y,Ans;
int dx[8],dy[8];
bool map[MAX][MAX];
int step[MAX][MAX];
point S,T;
tQueue Q;
 
void init()
{
	int i,j,c;
	freopen("bronlily.in","r",stdin);
	freopen("bronlily.out","w",stdout);
	cin >> N >> M >> X >> Y;
	for (i=1;i<=N;i++)
	{
		for (j=1;j<=M;j++)
		{
			cin >> c;
			if (c==1 || c==4)
				map[i][j]=true;
			if (c==3)
				S.x=i,S.y=j;
			if (c==4)
				T.x=i,T.y=j;
		}
	}
	dx[0]=-X; dy[0]=-Y;
	dx[1]=-X; dy[1]= Y;
	dx[2]= X; dy[2]=-Y;
	dx[3]= X; dy[3]= Y;
	dx[4]=-Y; dy[4]=-X;
	dx[5]=-Y; dy[5]= X;
	dx[6]= Y; dy[6]=-X;
	dx[7]= Y; dy[7]= X;
}
 
inline bool inrange(point p)
{
	return p.x>=1 && p.x <=N && p.y >=1 && p.y<=M;
}
 
int bfs()
{
	int k;
	point i,j;
	Q.add(S);
	while (Q.size)
	{
		i=Q.del();
		for (k=0;k<8;k++)
		{
			j.x=i.x+dx[k];
			j.y=i.y+dy[k];
			if (inrange(j) && map[j.x][j.y] && step[j.x][j.y]==0)
			{
				step[j.x][j.y]=step[i.x][i.y] + 1;
				if (j.x==T.x && j.y==T.y)
					return step[j.x][j.y];
				Q.add(j);
			}
		}
	}
}
 
int main()
{
	init();
	Ans=bfs();
	cout << Ans << endl;
	return 0;
}