from collections import deque
H,W = map(int,input().split())
A = [list(map(int,input().split())) for _ in range(H)]
que = deque([])
que.append((0,0,A[0][0],0))
ans = "No"
while que:
    i,j,a,s = que.popleft()
    if i==H-1 and j==W-1 and a>A[H-1][W-1]:
        ans = "Yes"
        break
    if i+1<H and A[i+1][j]<a:
        que.append((i+1,j,a+A[i+1][j],s))
    elif i+1<H and A[i+1][j]>=a and s==0:
        que.append((i+1,j,a,1))
    if j+1<W and A[i][j+1]<a:
        que.append((i,j+1,a+A[i][j+1],s))
    elif j+1<W and A[i][j+1]>=a and s==0:
        que.append((i,j+1,a,1))
print(ans)