#include <math.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define print(n) cout << (n) << endl
#define fprint(n) cout << setprecision(16) << (n) << endl
#define ceil_div(a, b) (((a) - 1) / (b) + 1)
#define rep(i, l, n) for (int i = (l); i < (n); i++)
#define itrep(itr, st) for (auto itr = st.begin(); itr != st.end(); itr++)
#define ite(i, a) for (auto& i : a)
#define all(x) x.begin(), x.end()
#define lb lower_bound
#define ub upper_bound
#define lbi(A, x) (ll)(lb(all(A), x) - A.begin())
#define ubi(A, x) (ll)(ub(all(A), x) - A.begin())
using str = string;
using ll = long long;
using Pair = pair<int, int>;
using mint = modint1000000007;
using Mint = modint998244353;
template <class T>	using V = vector<T>;
template <class T>	using VV = V<V<T> >;
template <class T>	using PQ = priority_queue<T, V<T>, greater<T> >;
template <class T>	using PQR = priority_queue<T>;
template <class T>	using BIT = fenwick_tree<T>;
const ll INF = 4611686018427387903;
const int inf = 2147483647;
const ll mod = 1000000007;
const ll MOD = 998244353;
template <class T>  inline V<T> getList(int n) { V<T> res(n); rep(i, 0, n) { cin >> res[i]; }return res; }
template <class T>  inline VV<T> getGrid(int m, int n) { VV<T> res(m, V<T>(n)); rep(i, 0, m) { res[i] = getList<T>(n); }return res; }
template <class T> inline void prints(V<T>& vec) { if (vec.size() == 0)return; cout << vec[0];	rep(i, 1, vec.size()) { cout << ' ' << vec[i]; } cout << '\n'; }
inline V<int> dtois(string& s) { V<int> vec = {}; ite(e, s) { vec.push_back(e - '0'); } return vec; }
inline V<int> atois(string& s) { V<int> vec = {}; ite(e, s) { vec.push_back(e - 'a'); } return vec; }
inline V<int> Atois(string& s) { V<int> vec = {}; ite(e, s) { vec.push_back(e - 'A'); } return vec; }


int main(void) {
	ll h, w;	cin >> h >> w;
	VV<ll> a = getGrid<ll>(h, w);

	VV<V<ll> > dp(h, VV<ll>(w, V<ll>(2)));
	dp[0][0][0] = a[0][0];
	deque<V<ll> > que = { {0,0,0} };
	while (que.empty() == false) {
		ll x = que[0][0], y = que[0][1], c = que[0][2];
		ll t = dp[x][y][c];
		que.pop_front();
		V<ll> dx = { 1,0 }, dy = { 0,1 };
		rep(i, 0, 2) {
			ll nx = x + dx[i], ny = y + dy[i];
			if (nx < 0 or nx >= h or ny < 0 or ny >= w) {
				continue;
			}
			if (t > a[nx][ny] and t + a[nx][ny] > dp[nx][ny][c]) {
				bool b = (dp[nx][ny][c] > 0);
				dp[nx][ny][c] = t + a[nx][ny];
				if (b) {
					continue;
				}
				que.push_back({ nx, ny, c });
			}
			else if (c == 0 and (nx != h - 1 or ny != w - 1) and t > dp[nx][ny][1]) {
				bool b = (dp[nx][ny][1] > 0);
				dp[nx][ny][1] = t;
				if (b) {
					continue;
				}
				que.push_back({ nx, ny, 1 });
			}
		}
	}
	
	if (dp[h - 1][w - 1][0] + dp[h - 1][w - 1][1] > 0) {
		print("Yes");
	}
	else {
		print("No");
	}

	return 0;
}