H, W = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(H)]

dp = [[[0] * 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 reversed(range(2)):
            if 0 < j < W:
                if dp[i][j - 1][k] > A[i][j]:
                    dp[i][j][k] = max(dp[i][j][k], dp[i][j - 1][k] + A[i][j])
                else:
                    if k == 0:
                        dp[i][j][1] = max(dp[i][j][1], dp[i][j - 1][0])
            if 0 < i < H:
                if dp[i - 1][j][k] > A[i][j]:
                    dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j][k] + A[i][j])
                else:
                    if k == 0:
                        dp[i][j][1] = max(dp[i][j][1], dp[i - 1][j][0])
if max(dp[-1][-1]) > A[-1][-1]:
    print("Yes")
else:
    print("No")