import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 15

H, W = map(int, input().split())
A = list(list(map(int, input().split())) for _ in range(H))
dp = [[[-inf] * 2 for _ in range(W)] for _ in range(H)]
dp[0][0][0] = A[0][0]
for i in range(H):
    for j in range(W):
        for k in range(2):
            if i + 1 < H:
                if dp[i][j][k] > A[i+1][j]:
                    dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k] + A[i+1][j])
                elif k == 0:
                    dp[i+1][j][k+1] = max(dp[i+1][j][k+1], dp[i][j][k])
            if j + 1 < W:
                if dp[i][j][k] > A[i][j+1]:
                    dp[i][j+1][k] = max(dp[i][j+1][k], dp[i][j][k] + A[i][j+1])
                elif k == 0:
                    dp[i][j+1][k+1] = max(dp[i][j+1][k+1], dp[i][j][k])


if max(dp[H-1][W-1]) > A[H-1][W-1]:
    print("Yes")
else:
    print("No")