#include using namespace std; #include #include //#define int long long #define REP(i,m,n) for(int i=(m);i<(n);i++) #define rep(i,n) REP(i,0,n) #define pb push_back #define all(a) a.begin(),a.end() #define rall(c) (c).rbegin(),(c).rend() #define mp make_pair #define endl '\n' //#define vec vector //#define mat vector > #define fi first #define se second #define double long double typedef long long ll; typedef unsigned long long ull; typedef pair pll; //typedef long double ld; typedef complex Complex; const ll INF=1e9+7; const ll MOD=998244353; const ll inf=INF*INF; const ll mod=INF; const ll MAX=200010; const double PI=acos(-1.0); typedef vector > mat; typedef vector vec; ll dx[]={0,1,0,-1}; ll dy[]={1,0,-1,0}; void solve(){ ll H,W;cin>>H>>W; vector >A(H,vector(W)); vector > >dp(H,vector >(W,vector(2,-inf))); rep(i,H){ rep(j,W)cin>>A[i][j]; } dp[0][0][0]=A[0][0]; rep(i,H){ rep(j,W){ rep(k,2){ if(dp[i][j][k]==-inf)continue; if(i+1A[i+1][j])dp[i+1][j][k]=max(dp[i+1][j][k],dp[i][j][k]+A[i+1][j]); else if(k==0&&(i+1A[i][j+1])dp[i][j+1][k]=max(dp[i][j+1][k],dp[i][j][k]+A[i][j+1]); else if(k==0&&(i=0?"Yes":"No")<