use std::{collections::BinaryHeap, cmp::Reverse};

fn main() {
    println!("{}", if solve() { "Yes" } else { "No" });
}

fn solve() -> bool {
    let (h, w, y, x) = {
        let mut line = String::new();
        std::io::stdin().read_line(&mut line).unwrap();
        let mut iter = line.split_whitespace();
        (
            iter.next().unwrap().parse::<usize>().unwrap(),
            iter.next().unwrap().parse::<usize>().unwrap(),
            iter.next().unwrap().parse::<usize>().unwrap() - 1,
            iter.next().unwrap().parse::<usize>().unwrap() - 1,
        )
    };
    let mut aaa = vec![];
    for _ in 0..h {
        let mut line = String::new();
        std::io::stdin().read_line(&mut line).unwrap();
        aaa.push(
            line.split_whitespace()
                .map(|x| x.parse::<usize>().unwrap())
                .collect::<Vec<_>>(),
        );
    }

    let mut player_power = aaa[y][x];
    let mut visited = vec![vec![false; w]; h];
    visited[y][x] = true;
    let mut heap = BinaryHeap::from(vec![(Reverse(0), (y, x))]);

    while let Some((enemy_power, (y, x))) = heap.pop() {
        if player_power <= enemy_power.0 {
            return false;
        }

        player_power += enemy_power.0;

        if y > 0 && !visited[y - 1][x] {
            heap.push((Reverse(aaa[y - 1][x]), (y - 1, x)));
            visited[y - 1][x] = true;
        }
        if y < h - 1 && !visited[y + 1][x] {
            heap.push((Reverse(aaa[y + 1][x]), (y + 1, x)));
            visited[y + 1][x] = true;
        }
        if x > 0 && !visited[y][x - 1] {
            heap.push((Reverse(aaa[y][x - 1]), (y, x - 1)));
            visited[y][x - 1] = true;
        }
        if x < w - 1 && !visited[y][x + 1] {
            heap.push((Reverse(aaa[y][x + 1]), (y, x + 1)));
            visited[y][x + 1] = true;
        }
    }

    true
}