#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int h, w; cin >> h >> w;
  vector a(h, vector(w, 0)); REP(i, h) REP(j, w) cin >> a[i][j];
  vector dp(h, vector(w, vector(2, -LINF)));
  dp[0][0][false] = a[0][0];
  REP(i, h) REP(j, w) {
    if (i > 0) {
      REP(k, 2) {
        if (dp[i - 1][j][k] > a[i][j]) chmax(dp[i][j][k], dp[i - 1][j][k] + a[i][j]);
      }
      if (i + 1 < h || j + 1 < w) chmax(dp[i][j][true], dp[i - 1][j][false]);
    }
    if (j > 0) {
      REP(k, 2) {
        if (dp[i][j - 1][k] > a[i][j]) chmax(dp[i][j][k], dp[i][j - 1][k] + a[i][j]);
      }
      if (i + 1 < h || j + 1 < w) chmax(dp[i][j][true], dp[i][j - 1][false]);
    }
  }
  cout << (*max_element(ALL(dp[h - 1][w - 1])) >= a[0][0] ? "Yes\n" : "No\n");
  return 0;
}