hdu 1760

#include<cstdio>
#include<cstring>
using namespace std;
int d[100][100],n,m;
int ok(int i,int j)
{
	if(!d[i][j]&&!d[i+1][j]&&!d[i][j+1]&&!d[i+1][j+1])
	return 1;
	else
	return 0;
}
int dfs()
{
	for(int i=0;i<n-1;i++)
	for(int j=0;j<m-1;j++)
	{
		if(ok(i,j))
		{
			d[i][j]=d[i+1][j]=d[i][j+1]=d[i+1][j+1]=1;
			if(!dfs())
			{
				d[i][j]=d[i+1][j]=d[i][j+1]=d[i+1][j+1]=0;
				return 1;
			}
			d[i][j]=d[i+1][j]=d[i][j+1]=d[i+1][j+1]=0;
		}
	}
	return 0;
}
int main()
{
	char str[1000];
	while(~scanf("%d%d",&n,&m)&&(n+m))
	{
		for(int i=0;i<n;i++)
		{
			scanf("%s",str);
			for(int j=0;j<m;j++)
			d[i][j]=str[j]=='1'?1:0; 
		}
		if(dfs())
		printf("Yes\n");
		else
		printf("No\n");
	}
}