H,W = map(int,input().split())
A = [list(map(int,input().split())) for _ in range(H)]
dp = [[[0,0] for _ in range(W)] for _ in range(H)]
dp[0][0][0] = A[0][0]
dp[0][0][1] = 0
for i in range(H-1):
    if dp[i][0][0]>A[i+1][0]:
        dp[i+1][0][0] = max(dp[i+1][0][0],dp[i][0][0]+A[i+1][0])
    elif dp[i][0][0]<=A[i+1][0]:
        dp[i+1][0][1] = max(dp[i+1][0][1],dp[i][0][0])
    if dp[i][0][1]>A[i+1][0]:
        dp[i+1][0][1] = max(dp[i+1][0][1],dp[i][0][1]+A[i+1][0])
for j in range(W-1):
    if dp[0][j][0]>A[0][j+1]:
        dp[0][j+1][0] = max(dp[0][j+1][0],dp[0][j][0]+A[0][j+1])
    elif dp[0][j][0]<=A[0][j+1]:
        dp[0][j+1][1] = max(dp[0][j+1][1],dp[0][j][0])
    if dp[0][j+1][1]>A[0][j+1]:
        dp[0][j+1][1] = max(dp[0][j+1][1],dp[0][j+1][1]+A[0][j+1])
for i in range(1,H):
    for j in range(1,W):
        if dp[i-1][j][0]>A[i][j]:
            dp[i][j][0] = max(dp[i][j][0],dp[i-1][j][0]+A[i][j])
        else:
            dp[i][j][1] = max(dp[i][j][1],dp[i-1][j][0])
        if dp[i][j-1][0]>A[i][j]:
            dp[i][j][0] = max(dp[i][j][0],dp[i][j-1][0]+A[i][j])
        else:
            dp[i][j][1] = max(dp[i][j][1],dp[i][j-1][0])
        if dp[i-1][j][1]>A[i][j]:
            dp[i][j][1] = max(dp[i][j][1],dp[i-1][j][1]+A[i][j])
        if dp[i][j-1][1]>A[i][j]:
            dp[i][j][1] = max(dp[i][j][1],dp[i][j-1][1]+A[i][j])
if max(dp[H-1][W-1][0],dp[H-1][W-1][1])>A[H-1][W-1]:
    print("Yes")
else:
    print("No")