#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 3000
//#define MOD 1000000007
#define MOD 998244353
#define INF 1000000000
//#define INF 1000000000000000000

int main(){
  int H,W;
  cin>>H>>W;
  vector<vector<ll>> A(H,vector<ll>(W));
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      cin>>A[i][j];
    }
  }

  vector<vector<vector<ll>>> dp(H,vector<vector<ll>>(W,vector<ll>(2,0)));
  dp[0][0][0]=A[0][0];
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      if(i<H-1){
        if(dp[i][j][0]>A[i+1][j]){
          dp[i+1][j][0]=max<ll>(dp[i+1][j][0],dp[i][j][0]+A[i+1][j]);
        }else{
          dp[i+1][j][1]=max<ll>(dp[i+1][j][1],dp[i][j][0]);
        }
        if(dp[i][j][1]>A[i+1][j]){
          dp[i+1][j][1]=max<ll>(dp[i+1][j][1],dp[i][j][1]+A[i+1][j]);
        }
      }
      if(j<W-1){
        if(dp[i][j][0]>A[i][j+1]){
          dp[i][j+1][0]=max<ll>(dp[i][j+1][0],dp[i][j][0]+A[i][j+1]);
        }else{
          dp[i][j+1][1]=max<ll>(dp[i][j+1][1],dp[i][j][0]);
        }
        if(dp[i][j][1]>A[i][j+1]){
          dp[i][j+1][1]=max<ll>(dp[i][j+1][1],dp[i][j][1]+A[i][j+1]);
        }
      }
    }
  }

  if(max({dp[H-1][W-2][0],dp[H-1][W-2][1],dp[H-2][W-1][0],dp[H-2][W-1][1]})>A[H-1][W-1]){
    cout<<"Yes"<<'\n';
  }else{
    cout<<"No"<<'\n';
  }
}