import sys

def main():
    n_m = sys.stdin.readline().strip('\n')
    n_m = [int(i) for i in n_m.split()]
    matrix = []
    position = sys.stdin.readline().strip('\n')
    position = [int(i) for i in position.split()]
    for i in range(n_m[0]):
        line_i = sys.stdin.readline().strip('\n')
        line_i_num = [float(k) for k in line_i.split()]
        matrix.append(line_i_num)
    print(n_m, position, matrix)
    
    result = solution(position, matrix, n_m)
    sys.stdout。write(result)
    
def solution(position, matrix, n_m):
    path = hasPath(position, matrix, n_m)
    if not path:
        return matrix[position[0]][position[1]]
    result = []
    for i in path:
        if i == 1:
            result.append(solution([position[0]+1, position[1]], matrix, n_m))
        if i == 2:
            result.append(solution([position[0]-1, position[1]], matrix, n_m))
        if i == 3:
            result.append(solution([position[0], position[1]+1], matrix, n_m))
        if i == 4:
            result.append(solution([position[0], position[1]-1], matrix, n_m))
    return max(result)
            
def hasPath(position, matrix, n_m):
    path = []
    print(position)
    if 0 <= position[0]+1 < n_m[0] and matrix[position[0]][position[1]] < matrix[position[0]+1][position[1]]:
        path.append(1)
    if 0 <= position[0]-1 < n_m[0] and matrix[position[0]][position[1]] < matrix[position[0]-1][position[1]]:
        path.append(2)
    if 0 <= position[1]+1 < n_m[1] and matrix[position[0]][position[1]] < matrix[position[0]][position[1]+1]:
        path.append(3)
    if 0 <= position[1]-1 < n_m[1] and matrix[position[0]][position[1]] < matrix[position[0]][position[1]-1]:
        path.append(4)
    return path      
    
if __name__ =="__main__":
    main1()