#include<bits/stdc++.h> using namespace std; int n,m,t; int qi[200][200]; int check(){ for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ if(qi[i][j]!=0){ if(j+4<=m){ if(qi[i][j]==qi[i][j+1]&& qi[i][j]==qi[i][j+2]&& qi[i][j]==qi[i][j+3]&& qi[i][j]==qi[i][j+4]) return 1; } if(i+4<=n){ if(qi[i][j]==qi[i+1][j]&& qi[i][j]==qi[i+2][j]&& qi[i][j]==qi[i+3][j]&& qi[i][j]==qi[i+4][j]) return 1; } if(j+4<=m&&i+4<=n){ if(qi[i][j]==qi[i+1][j+1]&& qi[i][j]==qi[i+2][j+2]&& qi[i][j]==qi[i+3][j+3]&& qi[i][j]==qi[i+4][j+4]) return 1; } if(j>4&&i+4<=n){ if(qi[i][j]==qi[i+1][j-1]&& qi[i][j]==qi[i+2][j-2]&& qi[i][j]==qi[i+3][j-3]&& qi[i][j]==qi[i+4][j-4]) return 1; } } } } return 0; } int main(){ cin>>n>>m>>t; for(int i=1;i<=t;i++){ for(int j=1;j<=n;j++){ for(int k=1;k<=m;k++){ cin>>qi[j][k]; } } cout<<(check()?"Yes":"No")<<endl; } return 0; }