#if !__INCLUDE_LEVEL__

#include __FILE__
vector<vector<bool>> seen(1000,vector<bool>(1000,false));

int di[4]={ 0, 1, 0,-1}; // 縦軸方向への変位
int dj[4]={ 1, 0,-1, 0}; // 横軸方向への変位
bool gool = false;
void dfs(const vvl &A, int i, int j,bool cont,ll str) {
    seen[i][j] = true;
    if(i==A.size()-1 && j == A[0].size()-1 && A[i][j] < str){
        gool = true;
    }
    rep(t,4){
        ll vi = i+di[t];
        ll vj = j+dj[t];
        if(0<=vi && vi<A.size() && 0<=vj && vj<A[0].size()){
            if(!seen[vi][vj]){
                if(A[i][j]<str)dfs(A,vi,vj,cont,str+A[i][j]);
                else{
                    if(cont){
                        cont = false;
                        dfs(A,vi,vj,cont,str);
                    }
                }
            }
        }
    }
    seen[i][j] = false;
}
int main()
{
    ll H,W;cin >> H >> W;
    vvl A(H,vl(W));
    rep(i,H){
        rep(j,W){
            cin >> A[i][j];
        }
    }
    seen[0][0] = true;
    dfs(A,0,1,true,A[0][0]);
    if(gool)cout << "Yes" << endl;
    else cout << "No" << endl;
}

#else

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rrep(i, n) for(int i = n; i >= 0; i--)
#define range(i, m, n) for(int i = m; i < n; i++)
#define fore(i,a) for(auto &i:a)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define sum(v) accumulate(all(v),0)
#define minv(v) *min_element(all(v))
#define maxv(v) *max_element(all(v))
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
const ll INF = 1e16;
const ll MOD1 = 1000000007;
const ll MOD2 = 998244353;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll SN(char s){return ll(s-'0');}
ll SN(string s){return stoll(s);}
int alpN(char s){return int(s-'a');}
int AlpN(char s){return int(s-'a');}
using Graph = vector<vector<ll>>;
using mint1 = modint1000000007;
using mint2 = modint998244353;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){for(int i=0;i<(int)v.size();i++)o<<(i>0?" ":"")<<v[i];return o;}//vector空白区切り出力
ostream& operator<<(ostream& os, const mint1& N) {return os << N.val();}//mint出力。デフォはmint1
ostream& operator<<(ostream& os, const mint2& N) {return os << N.val();}
template<class T> bool contain(const std::string& s, const T& v) {
    return s.find(v) != std::string::npos;
}

#endif