难😕

#include<iostream>
#include<cstring>
#include<string.h>
#include<cstdio>
#include<algorithm>
using namespace std;
int m,n,a,b;
long long f[1005][1005],ff[105][1005],p1[1005],p2[1005],base1=131,base2=233,p[1000005];
char str;
int main(){
	cin>>m>>n>>a>>b;p1[0]=1;p2[0]=1;
	for(int i=1;i<=1000;i++){p1[i]=p1[i-1]*base1;p2[i]=p2[i-1]*base2;}
	for(int i=1;i<=m;i++){
		for(int j=1;j<=n;j++){
			cin>>str;
			f[i][j]=f[i][j-1]*base1+str-'0'+1;
		}
	}
	for(int i=1;i<=m;i++)
		for(int j=1;j<=n;j++)
		f[i][j]+=f[i-1][j]*base2;
	int tot=0;
	for(int i=a;i<=m;i++)for(int j=b;j<=n;j++)p[++tot]=f[i][j]-f[i][j-b]*p1[b]-f[i-a][j]*p2[a]+f[i-a][j-b]*p1[b]*p2[a];
	sort(p+1,p+1+tot);
	int q;cin>>q;
	for(int k=1;k<=q;k++){	
		for(int i=1;i<=a;i++){
		    for(int j=1;j<=b;j++){
			    cin>>str;
				ff[i][j]=ff[i][j-1]*base1+str-'0'+1;
			}
		}
		for(int i=1;i<=a;i++)
			for(int j=1;j<=b;j++)
				ff[i][j]+=ff[i-1][j]*base2;
		int flag=lower_bound(p+1,p+1+tot,ff[a][b])-p;
		if(p[flag]==ff[a][b])cout<<1<<endl;
		else cout<<0<<endl;
	}
	return 0;
}