#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int h,w; cin >> h >> w;
    vector<vector<int>> a(h,vector<int>(w));
    for(int i=0;i<h;i++){
        for(int j=0;j<w;j++){
            cin >> a[i][j];
        }
    }
    vector<vector<ll>> dp1(h,vector<ll>(w,-1));
    auto dp2 = dp1;
    dp1[0][0] = a[0][0];
    for(int i=0;i<h;i++){
        for(int j=0;j<w;j++){
            dp2[i][j] = max(dp2[i][j],dp1[i][j]);
            if(dp1[i][j] != -1){
                if(i+1<h){
                    if(dp1[i][j] > a[i+1][j]){
                        dp1[i+1][j] = max(dp1[i+1][j], dp1[i][j]+a[i+1][j]);
                    }
                    else{
                        dp2[i+1][j] = max(dp2[i+1][j], dp1[i][j]);
                    }
                }
                if(j+1<w){
                    if(dp1[i][j] > a[i][j+1]){
                        dp1[i][j+1] = max(dp1[i][j+1], dp1[i][j]+a[i][j+1]);
                    }
                    else{
                        dp2[i][j+1] = max(dp2[i][j+1], dp1[i][j]);
                    }
                }
            }
            if(dp2[i][j] != -1){
                if(i+1<h){
                    if(dp2[i][j] > a[i+1][j]){
                        dp2[i+1][j] = max(dp2[i+1][j], dp2[i][j]+a[i+1][j]);
                    }
                }
                if(j+1<w){
                    if(dp2[i][j] > a[i][j+1]){
                        dp2[i][j+1] = max(dp2[i][j+1], dp2[i][j]+a[i][j+1]);
                    }
                }
            }
        }
    }
    if(dp2[h-1][w-1] > a[h-1][w-1]){
        cout << "Yes" << endl;
    }
    else{
        cout << "No" << endl;
    }
}