#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

int main() {
  int h, w; cin >> h >> w;
  vector<vector<ll>> a(h + 1, vector<ll>(w + 1));
  for (int i = 1; i <= h; i++) {
    for (int j = 1; j <= w; j++) cin >> a[i][j];
  }
  vector<vector<vector<ll>>> dp(h + 1, vector(w + 1, vector<ll>(2)));
  for (int i = 1; i <= h; i++) {
    for (int j = 1; j <= w; j++) {
      if (i == 1 && j == 1) {
        dp[i][j][0] = a[i][j];
        continue;
      }
      if (i == h && j == w) continue;
      if (a[i][j] >= dp[i - 1][j][0]) dp[i][j][1] = max(dp[i][j][1], dp[i - 1][j][0]);
      if (a[i][j] >= dp[i][j - 1][0]) dp[i][j][1] = max(dp[i][j][1], dp[i][j - 1][0]);
      for (int k = 0; k < 2; k++) {
        if (a[i][j] < dp[i - 1][j][k]) dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j][k] + a[i][j]);
        if (a[i][j] < dp[i][j - 1][k]) dp[i][j][k] = max(dp[i][j][k], dp[i][j - 1][k] + a[i][j]);
      }
    }
  }
  cout << (max({dp[h][w - 1][0], dp[h][w - 1][1], dp[h - 1][w][0], dp[h - 1][w][1]}) > a[h][w] ? "Yes": "No") << endl;
  return 0;
}