#int(input())
#map(int, input().split())
#list(map(int, input().split()))

H, W = map(int, input().split())

A = [0] * H
for i in range(H):
    A[i] = list(map(int, input().split()))

dp = [[[0] * 2 for i in range(W)] for i in range(H)]

dp[1][0][0] = A[0][0]
dp[0][1][0] = A[0][0]

for i in range(H):
    for j in range(W):
        if dp[i][j][0] > A[i][j]:
            if i + 1 < H:
                dp[i+1][j][0] = max(dp[i+1][j][0], dp[i][j][0] + A[i][j])
            if j + 1 < W:
                dp[i][j+1][0] = max(dp[i][j+1][0], dp[i][j][0] + A[i][j])
        else:
            if i + 1 < H:
                dp[i+1][j][1] = max(dp[i+1][j][1], dp[i][j][0])
            if j + 1 < W:
                dp[i][j+1][1] = max(dp[i][j+1][1], dp[i][j][0])
        if dp[i][j][1] > A[i][j]:
            if i + 1 < H:
                dp[i+1][j][1] = max(dp[i+1][j][1], dp[i][j][1] + A[i][j])
            if j + 1 < W:
                dp[i][j+1][1] = max(dp[i][j+1][1], dp[i][j][1] + A[i][j])

f = 0

for i in range(2):
    if dp[H-1][W-1][i] > A[H-1][W-1]:
        f = 1

# for i in range(H):
#     print(dp[i])

if f:
    print("Yes")
else:
    print("No")