#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <limits>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
struct Inf { template<typename T> constexpr operator T() { return numeric_limits<T>::max() / 2; } };
// clang-format on

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int h, w;
    cin >> h >> w;
    auto mp = make_v(h, w, 0LL);
    rep(i, 0, h) rep(j, 0, w) {
        cin >> mp[i][j];
    }

    auto dp = make_v(h, w, 2, 0LL);
    dp[0][0][0] = mp[0][0];
    rep(i, 0, h) {
        rep(j, 0, w) {
            rep(t, 0, 2) {
                if (i + 1 < h) {
                    if (dp[i][j][t] > mp[i + 1][j]) {
                        chmax(dp[i + 1][j][t], dp[i][j][t] + mp[i + 1][j]);
                    } else if (t == 0 && (i + 1 != h - 1 || j != w - 1)) {
                        chmax(dp[i + 1][j][1], dp[i][j][0]);
                    }
                }
                if (j + 1 < w) {
                    if (dp[i][j][t] > mp[i][j + 1]) {
                        chmax(dp[i][j + 1][t], dp[i][j][t] + mp[i][j + 1]);
                    } else if (t == 0 && (i != h - 1 || j + 1 != w - 1)) {
                        chmax(dp[i][j + 1][1], dp[i][j][0]);
                    }
                }
            }
        }
    }
    print(dp[h - 1][w - 1][0] || dp[h - 1][w - 1][1] ? "Yes" : "No");

    return 0;
}