H, W = map(int, input().split())
A = []
for i in range(H):
    A.append(list(map(int, input().split())))
    
inf = 10 ** 18
dp0 = [[-inf] * W for i in range(H)]
dp1 = [[-inf] * W for i in range(H)]
dp0[0][0] = A[0][0]
for i in range(H):
    for j in range(W):
        if i != H - 1:
            if A[i + 1][j] < dp0[i][j]:
                dp0[i + 1][j] = max(dp0[i + 1][j],  dp0[i][j] + A[i + 1][j])
            else:
                if (i + 1, j) != (H - 1, W - 1):
                    dp1[i + 1][j] = max(dp1[i + 1][j], dp0[i][j])
            if A[i + 1][j] < dp1[i][j]:
                dp1[i + 1][j] = max(dp1[i + 1][j], dp1[i][j] + A[i + 1][j])
        if j != W - 1:
            if A[i][j + 1] < dp0[i][j]:
                dp0[i][j + 1] = max(dp0[i][j + 1], dp0[i][j] + A[i][j + 1])
            else:
                if (i, j + 1) != (H - 1, W - 1):
                    dp1[i][j + 1] = max(dp1[i][j + 1], dp0[i][j])
            if A[i][j + 1] < dp1[i][j]:
                dp1[i][j + 1] = max(dp1[i][j + 1], dp1[i][j] + A[i][j + 1])
ans = max(dp0[-1][-1], dp1[-1][-1])
print("Yes") if ans > 0 else print("No")
# print(dp0)
# print(dp1)