#include<cstdio>

#include<cstring>

#include<algorithm>

#include<map>

#define ull unsigned long long

using namespace std;

const int N=,b1=1e9+,b2=;

int n,m,a,b; ull bn1[N],bn2[N],hs[N][N];

map<ull,bool> mp;

int main()

{

  scanf("%d%d%d%d",&n,&m,&a,&b);

  bn1[]=;for(int i=;i<=n;i++)bn1[i]=bn1[i-]*b1;

  bn2[]=;for(int i=;i<=m;i++)bn2[i]=bn2[i-]*b2;

  for(int i=,d;i<=n;i++)

    for(int j=;j<=m;j++)

      {

    scanf("%1d",&d); d++;//

    hs[i][j]=hs[i][j-]*b2+d;

      }

  for(int i=;i<=n;i++)

    for(int j=;j<=m;j++)

      hs[i][j]=hs[i-][j]*b1+hs[i][j];

  for(int i=a;i<=n;i++)

    for(int j=(i==a?b:);j<=m;j++)

      {

    ull tp=hs[i][j] - hs[i-a][j]*bn1[a]

      - hs[i][j-b]*bn2[b] + hs[i-a][j-b]*bn1[a]*bn2[b];

    mp[tp]=;

      }

  int Q; scanf("%d",&Q);

  while(Q--)

    {

      ull tmp=;

      for(int i=,d;i<=a;i++)

    for(int j=;j<=b;j++)

      {

        scanf("%1d",&d); d++;

        tmp+=d*bn1[a-i]*bn2[b-j];

      }

      puts(mp[tmp]?"":"");

    }

  return ;

}