import sys
input = sys.stdin.readline

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

DP=[[-1]*W for i in range(H)]
DP2=[[-1]*W for i in range(H)]


DP[0][0]=A[0][0]

for i in range(H):
    for j in range(W):
        if DP[i][j]==-1:
            continue
        if i+1<H:
            if A[i+1][j]<DP[i][j]:
                DP[i+1][j]=max(DP[i+1][j],DP[i][j]+A[i+1][j])
            else:
                DP2[i+1][j]=max(DP2[i+1][j],DP[i][j])
        if j+1<W:
            if A[i][j+1]<DP[i][j]:
                DP[i][j+1]=max(DP[i][j+1],DP[i][j]+A[i][j+1])
            else:
                DP2[i][j+1]=max(DP2[i][j+1],DP[i][j])

for i in range(H):
    for j in range(W):
        if DP2[i][j]==-1:
            continue
        if i+1<H:
            if A[i+1][j]<DP2[i][j]:
                DP2[i+1][j]=max(DP2[i+1][j],DP2[i][j]+A[i+1][j])
        if j+1<W:
            if A[i][j+1]<DP2[i][j]:
                DP2[i][j+1]=max(DP2[i][j+1],DP2[i][j]+A[i][j+1])
            
if DP[H-2][W-1]>A[-1][-1] or DP2[H-2][W-1]>A[-1][-1] or DP[H-1][W-2]>A[-1][-1] or DP2[H-1][W-2]>A[-1][-1]:
    print("Yes")
else:
    print("No")