def chmax(DP,i,v):
    if DP[i] < v: DP[i] = v
def chmin(DP,i,v):
    if DP[i] > v: DP[i] = v

H, W = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(H)]
dp = [[[-1] * (2) for _ in range(W)] for _ in range(H)]
dp[0][0][0] = A[0][0]
A[0][0] = 0

# くばるDP
for i in range(H):
    for j in range(W):
        for k in range(2):
            # 右
            if j + 1 < W:
                chmax(dp[i][j + 1], k, dp[i][j][k] + A[i][j] if dp[i][j][k] > A[i][j] else -1)
                if k == 0:
                    chmax(dp[i][j + 1], k + 1, dp[i][j][k])
            # 下
            if i + 1 < H:
                chmax(dp[i + 1][j], k, dp[i][j][k] + A[i][j] if dp[i][j][k] > A[i][j] else -1)
                if k == 0:
                    chmax(dp[i + 1][j], k + 1, dp[i][j][k])

X = max(dp[-1][-1])

if X > A[-1][-1]:
    print('Yes')
else:
    print('No')