#include <cstdio>
// #include <windows.h>
#include <algorithm>
using namespace std;

int main() {
    int T, N, M, n, m;
    scanf("%d", &T);
    char p[50][50], p1[50][50];
    while (T--) {
        scanf("%d%d", &N, &M);
        for (int i = 0; i < N; i++) {
            scanf("%s", &p[i]);
        }

        scanf("%d%d", &n, &m);
        for (int i = 0; i < n; i++) {
            scanf("%s", &p1[i]);
        }
        int cnt = 0;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < M; j++) {
                bool flag = true;
                for (int u = max(0, i - (n - 1) / 2); u <= min(N - 1, i + (n - 1) / 2); u++) {
                    for (int v = max(0, j - (m - 1) / 2); v <= min(M - 1, j + (m - 1) / 2); v++) {
                        if (flag == false)
                            break;
                        if (p[u][v] == '#' && p1[u - (i - (n - 1) / 2)][v - (j - (m - 1) / 2)] == '#') {
                            flag = false;
                        }
                    }
                    if (flag == false)
                        break;
                }
                if (flag) {
                    cnt++;
                }
            }
        }
        printf("%d\n", cnt);
    }
    // system("pause");
    return 0;
}