#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VVVI = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
using VD = vector<double>;
using VVD = vector<vector<double>>;
using VVVD = vector<vector<vector<double>>>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using P = pair<int, int>;
using VP = vector<P>;

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {1, 0, -1, 0};
constexpr int DY[] = {0, 1, 0, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

const ll MOD = 998244353;

ll mod_pow(ll x, ll n, ll mod) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

ll gcd(ll x, ll y) {
    if (y == 0) return x;
    return gcd(y, x % y);
}

int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int H, W;
    cin >> H >> W;
    VVI A(H, VI(W));
    REP(i, H) REP(j, W) cin >> A[i][j];
    // dp[i][j][k] コンティニューk回で(i, j)に居る時の攻撃力の最大値;
    VVVL dp(H, VVL(W, VL(2, -LINF)));
    dp[0][0][0] = A[0][0];
    REP(i, H) {
        REP(j, W) {
            if (i < H - 1 && !(i + 1 == H - 1 && j == W - 1)) chmax(dp[i + 1][j][1], dp[i][j][0]);
            if (j < W - 1 && !(i == H - 1 && j + 1 == W - 1)) chmax(dp[i][j + 1][1], dp[i][j][0]);
            REP(k, 2) {
                if (j < W - 1 && A[i][j + 1] < dp[i][j][k]) chmax(dp[i][j + 1][k], dp[i][j][k] + A[i][j + 1]);
                if (i < H - 1 && A[i + 1][j] < dp[i][j][k]) chmax(dp[i + 1][j][k], dp[i][j][k] + A[i + 1][j]);
            }
        }
    }
    if (dp[H - 1][W - 1][0] > -LINF || dp[H - 1][W - 1][1] > -LINF) cout << "Yes\n";
    else cout << "No\n";
    /*
    REP(i, H) {
        REP(j, W) cout << dp[i][j][0] << " ";
        cout << endl;
    }
    cout << endl;
    REP(i, H) {
        REP(j, W) cout << dp[i][j][1] << " ";
        cout << endl;
    }
    */
}