h, w = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(h)]
INF = 10 ** 9
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):
        if i + 1 < h:
            if dp[i][j][0] != -INF:
                if dp[i][j][0] > a[i+1][j]:
                    dp[i+1][j][0] = max(dp[i+1][j][0], dp[i][j][0] + a[i+1][j])
                elif i + 1 != h - 1 or j != w - 1:
                    dp[i+1][j][1] = max(dp[i+1][j][1], dp[i][j][0])
            if dp[i][j][1] > a[i+1][j]:
                dp[i+1][j][1] = max(dp[i+1][j][1], dp[i][j][1] + a[i+1][j])
        if j + 1 < w:
            if dp[i][j][0] != -INF:
                if dp[i][j][0] > a[i][j+1]:
                    dp[i][j+1][0] = max(dp[i][j+1][0], dp[i][j][0] + a[i][j+1])
                elif i != h - 1 or j + 1 != w - 1:
                    dp[i][j+1][1] = max(dp[i][j+1][1], dp[i][j][0])
            if dp[i][j][1] > a[i][j+1]:
                dp[i][j+1][1] = max(dp[i][j+1][1], dp[i][j][1] + a[i][j+1])
ans = max(dp[h-1][w-1])
print('Yes' if ans != -INF else 'No')