h,w = map(int,input().split())
a = [list(map(int,input().split())) for _ in range(h)]

dp = [[[0 for _ in range(w)] for _ in range(h)] for _ in range(2)]
dp[0][0][0] = a[0][0]

for i in range(h):
    for j in range(w):
        if i + 1 < h and dp[0][i][j] > a[i+1][j]:
            dp[0][i+1][j] = max(dp[0][i][j] + a[i+1][j],dp[0][i+1][j])
        elif i + 1 < h:
            dp[1][i+1][j] = max(dp[0][i][j],dp[1][i+1][j])

        if j + 1 < w and dp[0][i][j] > a[i][j+1]:
            dp[0][i][j+1] = max(dp[0][i][j] + a[i][j+1],dp[0][i][j+1])
        elif j + 1 < w:
            dp[1][i][j+1] = max(dp[0][i][j],dp[1][i][j+1])

        
        if i + 1 < h and dp[1][i][j] > a[i+1][j]:
            dp[1][i+1][j] = max(dp[1][i][j] + a[i+1][j],dp[1][i+1][j])
        if j + 1 < w and dp[1][i][j] > a[i][j+1]:
            dp[1][i][j+1] = max(dp[1][i][j] + a[i][j+1],dp[1][i][j+1])


if dp[0][-1][-1] > a[-1][-1] or dp[1][-1][-1] > a[-1][-1]:
    print("Yes")
else:
    print("No")