0分求调

#include<bits/stdc++.h>
using namespace std;
int T;
char a[110][110];
bool flag;
const char g[4][4] = {
	'0', '0', '0', '0',
	'0', '1', '1', '0',
	'0', '1', '1', '0',
	'0', '0', '0', '0'
};

bool check(int x, int y) {
	for (int i = 0; i < 4; i++) {
		for (int j = 0; j < 4; j++) {
			if (a[i + x][j + y] != g[i][j])
				return false;
		}
	}
	return true;
}

int main(){
	cin >> T;
	while(T--){
		int n,m;
		cin >> n >> m;
		for(int i = 1;i <= n;i++){
			for(int j = 1;j <= m;j++){
				cin >> a[i][j];
			}
		}
		if(n < 4 || m < 4){
			cout << "No" << endl;
			continue;
		}
		for (int i = 1; i <= n - 3; i++) {
    		for (int j = 1; j <= m - 3; j++) {
        		if (check(i, j))
            		flag = true;
    		}
		}
		if(flag == true){
			cout << "Yes"<<endl;
		}else{
			cout << "No"<<endl;
		}
	}
	return 0;
}