#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}


int main(){
  ll h,w;cin >> h >> w;
  vvl a(h,vl(w));rep(i,h)rep(j,w)cin >> a[i][j];
  ll dp[h][w][2];rep(i,h)rep(j,w)rep(k,2)dp[i][j][k]=-INF;
  dp[0][0][0]=a[0][0];
  rep(i,h){
    rep(j,w){
      if(i+1<h){
        if(dp[i][j][0]<=a[i+1][j]){
          if(i+1!=h-1||j!=w-1)chmax(dp[i+1][j][1],dp[i][j][0]);
        }
        else{
          chmax(dp[i+1][j][0],dp[i][j][0]+a[i+1][j]);
        }
        if(dp[i][j][1]>a[i+1][j]){
          chmax(dp[i+1][j][1],dp[i][j][1]+a[i+1][j]);
        }
      }
      if(j+1<w){
        if(dp[i][j][0]<=a[i][j+1]){
          if(i!=h-1||j+1!=w-1)chmax(dp[i][j+1][1],dp[i][j][0]);
        }
        else{
          chmax(dp[i][j+1][0],dp[i][j][0]+a[i][j+1]);
        }
        if(dp[i][j][1]>a[i][j+1]){
          chmax(dp[i][j+1][1],dp[i][j][1]+a[i][j+1]);
        }
      }
    }
  }
  if(dp[h-1][w-1][0]==-INF&&dp[h-1][w-1][1]==-INF)cout << "No" << endl;
  else cout << "Yes" <<endl;
}