#include<bits/stdc++.h>
using namespace std;
#include <unordered_set>
#include <random>
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=INF;
const ll MAX=200010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};

void solve(){
    ll H,W;cin>>H>>W;
    vector<vector<ll> >A(H,vector<ll>(W));
    vector<vector<vector<ll> > >dp(H,vector<vector<ll> >(W,vector<ll>(2,-inf)));
    rep(i,H){
        rep(j,W)cin>>A[i][j];
    }
    dp[0][0][0]=A[0][0];
    rep(i,H){
        rep(j,W){
            rep(k,2){
                if(dp[i][j][k]==-inf)continue;
                if(i+1<H){
                    if(dp[i][j][k]>A[i+1][j])dp[i+1][j][k]=max(dp[i+1][j][k],dp[i][j][k]+A[i+1][j]);
                    else if(k==0&&(i+1<H-1||j<W-1))dp[i+1][j][k+1]=max(dp[i+1][j][k+1],dp[i][j][k]);
                }
                if(j+1<W){
                    if(dp[i][j][k]>A[i][j+1])dp[i][j+1][k]=max(dp[i][j+1][k],dp[i][j][k]+A[i][j+1]);
                    else if(k==0&&(i<H-1||j+1<W-1))dp[i][j+1][k+1]=max(dp[i][j+1][k+1],dp[i][j][k]);
                }
            }
        }
    }
    ll ans=max(dp[H-1][W-1][0],dp[H-1][W-1][1]);
    cout<<(ans>=0?"Yes":"No")<<endl;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}