import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

h, w = LI()
aa = LLI(h)

dp0 = [[-1]*w for _ in range(h)]
dp1 = [[-1]*w for _ in range(h)]
dp0[0][0] = aa[0][0]

for i in range(h):
    for j in range(w):
        if i-1 >= 0 and dp0[i-1][j] > aa[i][j]: dp0[i][j] = dp0[i-1][j]+aa[i][j]
        if j-1 >= 0 and dp0[i][j-1] > aa[i][j]: dp0[i][j] = max(dp0[i][j], dp0[i][j-1]+aa[i][j])
for i in range(h):
    for j in range(w):
        if (i, j) != (h-1, w-1):
            if i-1 >= 0: dp1[i][j] = max(dp1[i][j], dp0[i-1][j])
            if j-1 >= 0: dp1[i][j] = max(dp1[i][j], dp0[i][j-1])
        if i-1 >= 0 and dp1[i-1][j] > aa[i][j]: dp1[i][j] = max(dp1[i][j], dp1[i-1][j]+aa[i][j])
        if j-1 >= 0 and dp1[i][j-1] > aa[i][j]: dp1[i][j] = max(dp1[i][j], dp1[i][j-1]+aa[i][j])
# p2D(dp0)
# p2D(dp1)

print("Yes" if dp0[-1][-1] > 0 or dp1[-1][-1] > 0 else "No")