#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define PA pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
//#include<boost/multiprecision/cpp_int.hpp>
//namespace mp=boost::multiprecision;
//using Bint=mp::cpp_int;
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
template<class T>void print(vector<T>A){REP(i,A.size()){if(i)cout<<" ";cout<<A[i];}cout<<endl;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
//using mint=modint1000000007;
using mint=modint998244353;
//const ll mod=1000000007;
const ll mod=998244353;
//using mint=modint;
int main(){
  ll H,W;cin>>H>>W;
  vector<vector<ll>>A(H,vector<ll>(W));
  REP(i,H)REP(j,W)cin>>A[i][j];
  vector<vector<vector<ll>>>DP(2,vector<vector<ll>>(H,vector<ll>(W)));
  DP[0][0][0]=DP[1][0][0]=A[0][0];
  REP(i,H)REP(j,W){
    if(i){
      if(A[i][j]<DP[0][i-1][j])chmax(DP[0][i][j],DP[0][i-1][j]+A[i][j]);
      else if(i+j!=H+W-2)chmax(DP[1][i][j],DP[0][i-1][j]);
      if(A[i][j]<DP[1][i-1][j])chmax(DP[1][i][j],DP[1][i-1][j]+A[i][j]);
    }
    if(j){
      if(A[i][j]<DP[0][i][j-1])chmax(DP[0][i][j],DP[0][i][j-1]+A[i][j]);
      else if(i+j!=H+W-2)chmax(DP[1][i][j],DP[0][i][j-1]);
      if(A[i][j]<DP[1][i][j-1])chmax(DP[1][i][j],DP[1][i][j-1]+A[i][j]);
    }
  }
  if(DP[1][H-1][W-1]>0)cout<<"Yes"<<endl;
  else cout<<"No"<<endl;
  return 0;
}