H,W = map(int,input().split())
A = []
for _ in range(H):
    tmp = list(map(int,input().split()))
    A.append(tmp)
def check(h,w):
    if 0 <= h < H and 0 <= w < W:
        return True
    else:
        return False
INF = float('inf')
dp0 = [[-INF] * W for _ in range(H)]
dp1 = [[-INF] * W for _ in range(H)]
dp0[0][0] = A[0][0]
for h in range(H):
    for w in range(W):
        for dh,dw in [(1,0),(0,1)]:
            nh = h + dh
            nw = w + dw
            if dp0[h][w] != -INF:
                if check(nh,nw) and A[nh][nw] < dp0[h][w]:
                    dp0[nh][nw] = max(dp0[h][w] + A[nh][nw] ,dp0[nh][nw])
                elif check(nh,nw) and A[nh][nw] >= dp0[h][w] and not (nh == H-1 and nw == W-1):
                    dp1[nh][nw] = max(dp0[h][w],dp1[nh][nw])
            if dp1[h][w] != -INF:
                if check(nh,nw) and A[nh][nw] < dp1[h][w]:
                    dp1[nh][nw] = max(dp1[h][w] + A[nh][nw],dp1[nh][nw])
if dp0[H-1][W-1] != -INF or dp1[H-1][W-1] != -INF:
    print('Yes')
else:
    print('No')