h,w = map(int,input().split())
G = [list(map(int,input().split()))for _ in range(h)]
from sys import setrecursionlimit
setrecursionlimit(300000)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

ret = []
def dfs(power,H,W,continued):
    # print(power,H,W,continued)
    if(H==h-1 and W==w-1):
        if(power>G[-1][-1]):
            print("Yes")
            exit()
        else:
            return
    for a,b in ((0,1),(1,0)):
        if(0<=H+a<h and 0<=W+b<w):
            if(G[H+a][W+b]<power):
                dfs(power+G[H+a][W+b],H+a,W+b,continued)
            else:
                if(continued==0):
                    dfs(power,H+a,W+b,continued+1)
dfs(G[0][0],0,0,0)
print("No")