#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define rep(i, n) for(int i=0;i<n;i++)
#define all(i, v) for(auto& i : v)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;

void chmax(ll &a, ll b) { a = max(a, b);}
int main() {
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false); 
    ll h, w;
    cin >> h >> w;
    vector dp(h, vector(w, vector(2, -1LL)));
    rep(i, h) rep(j, w) {
        ll a;
        cin >> a;
        if(i == j && i == 0) {
            dp[i][j][0] = a;
            continue;
        }
        if(i == 0) {
            rep(k, 2) {
                if(dp[i][j - 1][k] > a) {
                    dp[i][j][k] = dp[i][j - 1][k] + a;
                } 
                if(k == 0) chmax(dp[i][j][1], dp[i][j-1][0]);
            }
            continue;
        } 
        if(j == 0) {
            rep(k, 2) {
                if(dp[i - 1][j][k] > a) {
                    dp[i][j][k] = dp[i - 1][j][k] + a;
                } 
                if(k == 0) chmax(dp[i][j][1], dp[i-1][j][0]);
            }
            continue;
        }
        rep(k, 2) {
            if(dp[i - 1][j][k] > a) chmax(dp[i][j][k], dp[i - 1][j][k] + a);
            if(dp[i][j - 1][k] > a) chmax(dp[i][j][k], dp[i][j - 1][k] + a);
        }
        if(i == h - 1 && j == w - 1) continue;
        chmax(dp[i][j][1], dp[i][j-1][0]);
        chmax(dp[i][j][1], dp[i-1][j][0]);
    }
    cout << (dp[h - 1][w - 1][0] == -1 && dp[h - 1][w - 1][1] == -1 ? "No" : "Yes") << endl;
    return 0;
}