#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

void chmax(ll &a, ll b){ if(a < b) a = b; }

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int 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(H, vector<vector<ll>>(W, vector<ll>(2, -1e18)));
    dp[0][0][0] = dp[0][0][1] = A[0][0];
    rep(i,H)rep(j,W) {
        if(i + 1 < H) {
            int ni = i + 1, nj = j;
            int E = A[ni][nj];
            if(dp[i][j][0] > E) chmax(dp[ni][nj][0], dp[i][j][0] + E);
            else if(!(ni == H - 1 && nj == W - 1)) chmax(dp[ni][nj][1], dp[i][j][0]);
            if(dp[i][j][1] > E) chmax(dp[ni][nj][1], dp[i][j][1] + E);
        }
        if(j + 1 < W) {
            int ni = i, nj = j + 1;
            int E = A[ni][nj];
            if(dp[i][j][0] > E) chmax(dp[ni][nj][0], dp[i][j][0] + E);
            else if(!(ni == H - 1 && nj == W - 1)) chmax(dp[ni][nj][1], dp[i][j][0]);
            if(dp[i][j][1] > E) chmax(dp[ni][nj][1], dp[i][j][1] + E);
        }
    }
    cout << (dp[H - 1][W - 1][0] == -1e18 && dp[H - 1][W - 1][1] == -1e18 ? "No" : "Yes") << endl;
}