#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint H, W;
	cin >> H >> W;
	vvi v(H, vi(W));
	rep(i, H) vin(v[i]);

	lint a=0, b=0, c=0, x, y, z;
	vvi dp(H+1, vi(W+1, -1));
	vvi t(H+1, vi(W+1, -1));
	dp[1][1] = v[0][0];
	rep(i, H) {
		rep(j, W) {
			if (i+j == 0) continue;
			if (v[i][j] < max(dp[i][j+1], dp[i+1][j])) {
				dp[i+1][j+1] = max(dp[i+1][j], dp[i][j+1]) + v[i][j];
			}
		}
	}
	// rep(i, H+1) vout(dp[i]);
	rep(i, H) {
		for (int j = W-1; j >= 0; j--) {
			if (i == H-1 && j == W-1) continue;
			if (dp[i+1][j+1] == -1) {
				t[i+1][j+1] = max(dp[i+1][j], dp[i][j+1]);
			}
		}
	}
	rep(i, H) {
		rep(j, W) {
			chmax(dp[i+1][j+1], t[i+1][j+1]);
		}
	}
	// rep(i, H+1) vout(dp[i]);
	rep(i, H) {
		rep(j, W) {
			if (v[i][j] < max(dp[i][j+1], dp[i+1][j])) {
				chmax(dp[i+1][j+1], max(dp[i+1][j], dp[i][j+1]) + v[i][j]);
			}
		}
	}
	// rep(i, H+1) vout(dp[i]);
	if (dp[H][W] == -1) std::cout << "No" << '\n';
	else std::cout << "Yes" << '\n';
}