dyeoma 2020. 10. 2. 03:22
n,m = map(int, input().split())

x,y,d = map(int, input().split())
dx = [-1,0,1,0]
dy = [0,1,0,-1]
nx,ny = 0,0

cord = [[int(y) for y in input().split()]for x in range(n)]
#print(cord)

cnt = 1
cord[x][y] = -1
while 1:
    for _ in range(4):
        d = (d-1) % 4
        nx = x+dx[d]
        ny = y+dy[d]

        if(cord[nx][ny] == 0):
            cord[nx][ny] = -1
            x = nx
            y = ny
            #print(x,y)
            cnt += 1
            break

    if (x==nx and y==ny):
        continue

    # 4방향 모두 이미 갔거나 바다
    d = (d+2) % 4
    nx = x + dx[d]
    ny = y + dy[d]
    d = (d+2) % 4

    if(cord[nx][ny]==1):
        break
    else:
        x=nx
        y=ny
        #cnt += 1
        #print(x,y)

print(cnt)