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

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];

    auto h = [&](int i, int j){ return i * W + j; };
    auto h_inv = [&](int v){ return pair<int,int>{v / W, v % W}; };
    
    vector<ll> dp(H * W * 2, -1e18);
    auto p = [&](int x, int b){ return x * 2 + b; };
    queue<int> q;
    q.push(h(0, 0));
    dp[p(h(0, 0), 0)] = dp[p(h(0, 0), 1)] = A[0][0];
    int g = h(H - 1, W - 1);
    while(!q.empty()) {
        int from = q.front(); q.pop();
        auto [ci, cj] = h_inv(from);

        if(ci + 1 < H) {
            int i = ci + 1, j = cj;
            int to = h(i, j);
            int E = A[i][j];
            if(dp[p(from, 0)] > E) dp[p(to, 0)] = max(dp[p(to, 0)], dp[p(from, 0)] + E);
            else {
                if(to != g)
                    dp[p(to, 1)] = max(dp[p(to, 1)], dp[p(from, 0)]);
            }

            if(dp[p(from, 1)] > E) {
                dp[p(to, 1)] = max(dp[p(to, 1)], dp[p(from, 1)] + E);
            }
            q.push(to);
        }

        if(cj + 1 < W) {
            int i = ci, j = cj + 1;
            int to = h(i, j);
            int E = A[i][j];
            if(dp[p(from, 0)] > E) dp[p(to, 0)] = max(dp[p(to, 0)], dp[p(from, 0)] + E);
            else {
                if(to != g)
                    dp[p(to, 1)] = max(dp[p(to, 1)], dp[p(from, 0)]);
            }

            if(dp[p(from, 1)] > E) {
                dp[p(to, 1)] = max(dp[p(to, 1)], dp[p(from, 1)] + E);
            }
            q.push(to);
        }
    }
    
    cout << (dp[p(g, 0)] == -1e18 && dp[p(g, 1)] == -1e18 ? "No" : "Yes") << endl;
}