#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
char a[50][50], b[50][50];
bool flag;
int sum = 0;
int main() {
    int T;
    cin >> T;
    for (int i = 1; i <= T; i++) {
        sum = 0;
        memset(a, 0, sizeof(a));
        memset(b, 0, sizeof(b));
        int M, N;
        scanf("%d%d", &N, &M);
        for (int i = 0; i < N; i++) cin >> a[i];
        int m, n, mm, nn;
        scanf("%d%d", &n, &m);
        mm = (m - 1) / 2;
        nn = (n - 1) / 2;  //计算员工地图的中点坐标
        for (int i = 0; i < n; i++) cin >> b[i];
        for (int i = 0; i < N; i++)
            for (int j = 0; j < M; j++)  //依次中心坐标在原地图的各个点；
            {
                flag = 1;  //归1
                for (int s = -nn; s <= nn; s++)
                    for (int k = -mm; k <= mm; k++)  //把员工地图的各个点同原图比较
                        if ((i + s) >= 0 && (i + s) < N && (j + k) >= 0 && (j + k) < M)
                            if (b[nn + s][mm + k] == '#' && a[i + s][j + k] == '#')  //只考虑落在原地图上的点
                                flag = 0;
                if (flag)
                    sum++;
            }
        printf("%d\n", sum);
    }
    return 0;
}