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 h in range(H):
    for w in range(W):
        if h+1<H and DP[h][w][0]>A[h+1][w]:
            DP[h+1][w][0]=max(DP[h+1][w][0],DP[h][w][0]+A[h+1][w])
        if w+1<W and DP[h][w][0]>A[h][w+1]:
            DP[h][w+1][0]=max(DP[h][w+1][0],DP[h][w][0]+A[h][w+1])
        if h+1<H and DP[h][w][1]>A[h+1][w]:
            DP[h+1][w][1]=max(DP[h+1][w][1],DP[h][w][1]+A[h+1][w])
        if w+1<W and DP[h][w][1]>A[h][w+1]:
            DP[h][w+1][1]=max(DP[h][w+1][1],DP[h][w][1]+A[h][w+1])
        if h+1<H and DP[h][w][0]<=A[h+1][w]:
            DP[h+1][w][1]=max(DP[h+1][w][1],DP[h][w][0])
        if w+1<W and DP[h][w][0]<=A[h][w+1]:
            DP[h][w+1][1]=max(DP[h][w+1][1],DP[h][w][0])
if max(DP[H-1][W-1])>A[H-1][W-1]:
    print('Yes')
else:
    print('No')