#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long dp[505][505][3];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int h, w; cin >> h >> w;
	vector<vector<long long>> a(h, vector<long long>(w));
	rep(i, h)rep(j, w)cin >> a[i][j];
	dp[0][0][0] = a[0][0];
	dp[0][0][1] = a[0][0];
	rep(i, h)rep(j, w) {
		rep(k, 2) {
			if (i != h - 1) {
				int ni = i + 1;
				int nj = j + 0;
				if (dp[i][j][k] > a[ni][nj]) {
					chmax(dp[ni][nj][k], dp[i][j][k] + a[ni][nj]);
				}
				else {
					chmax(dp[ni][nj][k + 1], dp[i][j][k]);
				}

			}
			if (j != w - 1) {
				int ni = i + 0;
				int nj = j + 1;
				if (dp[i][j][k] > a[ni][nj]) {
					chmax(dp[ni][nj][k], dp[i][j][k] + a[ni][nj]);
				}
				else {
					chmax(dp[ni][nj][k + 1], dp[i][j][k]);
				}
			}
		}
	}
	/*rep(i, h) {
		rep(j, w) {
			cout << dp[i][j][0] << " ";
		}
		cout << endl;
	}
	rep(i, h) {
		rep(j, w) {
			cout << dp[i][j][1] << " ";
		}
		cout << endl;
	}*/
	bool chk = false;
	rep(i, 2)if (dp[h - 2][w - 1][i] > a[h - 1][w - 1])chk = true;
	rep(i, 2)if (dp[h - 1][w - 2][i] > a[h - 1][w - 1])chk = true;
	if (chk)cout << "Yes" << endl;
	else cout << "No" << endl;
	//らすべすしょり
	return 0;
}