import sys
#input = sys.stdin.readline
input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
#MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]


def main():
    H,W = map(int,input().split()); INF = pow(10,18)
    A = [list(map(int,input().split())) for _ in range(H)]

    #dp0: 一度も死なずにi,jにいるときの攻撃力の最大値
    #dp1: 一度死んだときにi,jにいるときの攻撃力の最大値
    dp0 = [[-INF]*W for _ in range(H)]
    dp1 = [[-INF]*W for _ in range(H)]
    dp0[0][0] = A[0][0]
    for i in range(H):
        for j in range(W):
            #貰うDP
            #左からの遷移
            if i-1 >= 0:
                #dp0
                if dp0[i-1][j] > A[i][j]:
                    dp0[i][j] = max(dp0[i][j], dp0[i-1][j] + A[i][j])
                else:
                    dp1[i][j] = max(dp1[i][j], dp0[i-1][j])
                #dp1
                if dp1[i-1][j] > A[i][j]:
                    dp1[i][j] = max(dp1[i][j], dp1[i-1][j] + A[i][j])
            #上からの遷移
            if j-1 >= 0:
                if dp0[i][j-1] > A[i][j]:
                    dp0[i][j] = max(dp0[i][j], dp0[i][j-1] + A[i][j])
                else:
                    dp1[i][j] = max(dp1[i][j], dp0[i][j-1])
                #dp1
                if dp1[i][j-1] > A[i][j]:
                    dp1[i][j] = max(dp1[i][j], dp1[i][j-1] + A[i][j])
    
    #print(dp0)
    #print(dp1)

    if dp1[H-1][W-1] > A[H-1][W-1] or dp0[H-1][W-1] > 0:
        print('Yes')
    else:
        print('No')



if __name__ == '__main__':
    main()