h,w = map(int,input().split())
G = [list(map(int,input().split()))+[0] for _ in range(h)]
G.append([0]*(w+1))
dpA = [[0]*(w+1) for _ in range(h+1)]
dpB = [[0]*(w+1) for _ in range(h+1)]
dpA[0][0]=G[0][0]
dpB[0][0]=G[0][0]

for i in range(h):
    for j in range(w):
        if(G[i+1][j]<dpA[i][j]):
            dpA[i+1][j]=max(dpA[i+1][j],dpA[i][j]+G[i+1][j])
        else:
            dpB[i+1][j]=max(dpB[i+1][j],dpA[i][j])

        if(G[i][j+1]<dpA[i][j]):
            dpA[i][j+1]=max(dpA[i][j+1],dpA[i][j]+G[i][j+1])
        else:
            dpB[i][j+1]=max(dpB[i][j+1],dpA[i][j])

        if(G[i+1][j]<dpB[i][j]):
            dpB[i+1][j]=max(dpB[i+1][j],dpB[i][j]+G[i+1][j])
        if(G[i][j+1]<dpB[i][j]):
            dpB[i][j+1]=max(dpB[i][j+1],dpB[i][j]+G[i][j+1])

if(dpA[-2][-2]>G[-2][-2] or dpB[-2][-2]>G[-2][-2]):
    print("Yes")
else:
    print("No")