#include <bits/stdc++.h>

using namespace std;

#define int long long
#define ld long double
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define nn '\n'
#define pi pair<int, int>
#define unmp unordered_map
#define uns unordered_set
#define lb lower_bound
#define ub upper_bound
#define pq priority_queue
#define TASK " "

#define FOR(i, a, n) for(int  i =  (a) ; i <= (n) ; i++ )
#define FORD(i, a, n) for(int i = (a); i >= (n); i--)
#define FORX(i, x) for(int (i) : (x))
#define ms(a, x) memset((a), (x), sizeof((a)))
#define all(a) (a).begin(), (a).end()
#define All(a, n) (a) + 1, (a) + 1 + n


const int INF = 1e18;
const int mod = 1e9+7;
const int N = 1e2  + 5;
int MOD = 998244353;
int bit[200000];
int n, m;
int d[N][N];
bool vis[N][N];
int a[N][N];
int moveX[] = {0, 0, 1, -1};
int moveY[] = {1, -1, 0, 0};
int st, sy;
bool ok;

void nhap(){
    cin >> m >> n;
    cin >> st >> sy;
    FOR(i, 1, m){
        FOR(j, 1, n){
            cin >> a[i][j];
        }
    }
}
void bfs(int sx, int sy){
    d[sx][sy] = 0;
    queue<pi> q;
    vis[sx][sy] = 1;
    q.push({sx, sy});
    while(!q.empty()){
        int x = q.front().fi;
        int y = q.front().se;
        q.pop();
        if(x == 1 || x == n || y == 1 || y == m){
            ok = true;
            cout<< d[x][y] << nn;
            return;
        }
        FOR(i, 0, 3){
            int u = x + moveX[i];
            int v = y + moveY[i];


            if(u < 1 || u > n || v < 1 || v > m || a[u][v] == 1){
                continue;
            }
            if(!vis[u][v]){
                d[u][v] = d[x][y] + 1;
                vis[u][v] = 1;
                q.push({u, v});
            }
        }
    }

}
signed main() {
	//freopen("CSBN.INP", "r", stdin);
	//freopen("CSBN.OUT", "w", stdout);
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	nhap();
	bfs(st, sy);
	return 0;

}