fn main() {
    let (h, w) = {
        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(),
        )
    };
    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 dp = vec![vec![vec![0; 2]; w]; h];
    dp[0][0][0] = aaa[0][0];

    for i in 0..h {
        for j in 0..w {
            if i > 0 {
                if dp[i - 1][j][0] > aaa[i][j] {
                    dp[i][j][0] = dp[i][j][0].max(dp[i - 1][j][0] + aaa[i][j]);
                } else if (i, j) != (h - 1, w - 1) {
                    dp[i][j][1] = dp[i][j][1].max(dp[i - 1][j][0]);
                }

                if dp[i - 1][j][1] > aaa[i][j] {
                    dp[i][j][1] = dp[i][j][1].max(dp[i - 1][j][1] + aaa[i][j]);
                }
            }

            if j > 0 {
                if dp[i][j - 1][0] > aaa[i][j] {
                    dp[i][j][0] = dp[i][j][0].max(dp[i][j - 1][0] + aaa[i][j]);
                } else if (i, j) != (h - 1, w - 1) {
                    dp[i][j][1] = dp[i][j][1].max(dp[i][j - 1][0]);
                }

                if dp[i][j - 1][1] > aaa[i][j] {
                    dp[i][j][1] = dp[i][j][1].max(dp[i][j - 1][1] + aaa[i][j]);
                }
            }
        }
    }

    let reachable = dp[h - 1][w - 1].iter().any(|&x| x != 0);
    println!("{}", if reachable { "Yes" } else { "No" });
}