ZOJ 2850 Beautiful Meadow

#include <iostream>
#include <cstdio>

using namespace std;
int main()
{
int p[10][10];
int n,m;
bool flag;
while(cin>>n>>m,n||m){
flag=true;
for(int i=0; i<n; i++)
for(int j=0; j<m; j++){
cin>>p[i][j];
if(!p[i][j]) flag=false;
}
if(flag){
cout<<"No"<<endl;
continue;
}
for(int k=1; k<m; k++)
if(p[0][k]==0&&p[0][k-1]==0){
cout<<"No"<<endl;
goto RL;
}

for(int i=1; i<n; i++)
for(int j=0; j<m; j++){
if(p[i][j]==0&&p[i-1][j]==0){
cout<<"No"<<endl;
goto RL;
}
if(j!=0){
if(p[i][j]==0&&p[i][j-1]==0){
cout<<"No"<<endl;
goto RL;
}
}
}
cout<<"Yes"<<endl;
continue;
RL:
continue;
}
return 0;
}