#include <iostream>
#include <queue>
#include <deque>
#include <vector>
#include <cstring>
using namespace std;
int n, m;
//0:빈칸 1:벽 2:청소함
int arr[50][50];
int ans = 0;
int numbering = 2;
//왼쪽으로 돈다
const int dx[] = { -1,0,1,0 };
const int dy[] = { 0,1,0,-1 };
//dir:0,1,2,3 = 북,동,남,서
//북->서->남->동
void go(int x, int y, int dir) {
    arr[x][y] = numbering++;
    ans++;
    int cnt = 0;
    while (1) {
        //3,4번조건
        if (cnt == 4) {
            int d = dir - 2;
            if (d < 0) {
                d += 4;
            }
            int nx = x + dx[d];
            int ny = y + dy[d];
            //뒤가 벽인경우
            if (arr[nx][ny] == 1) {
                break;
            }
            else {
                x = nx;
                y = ny;
                cnt = 0;
            }
        }
        else {
            //왼쪽방향
            int d = dir - 1;
            if (d < 0)
                d = 3;
            int nx = x + dx[d];
            int ny = y + dy[d];
            dir = d;
            //2-1 청소하지 않은 공간 존재
            if (arr[nx][ny] == 0) {
                arr[nx][ny] = numbering++;
                ans++;
                x = nx;
                y = ny;
                cnt = 0;
            }
            //2-2청소할 공간이 없음
            else {
                cnt++;
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> m;
    int r, c, d;
    cin >> r >> c >> d;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> arr[i][j];
        }
    }
    go(r, c, d);
    cout << ans;
    return 0;
}