#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//using LL = __int128
#define pi pair<ll, ll>
#define N 4444
ll n, m, t, w, l, a[N], vis[111][111];
char c[N][N];
int main(){
	scanf("%lld", &t);
	while(t--){
		scanf("%lld%lld%lld%lld", &w, &l, &n, &m);
		a[0] = a[2] = n;
		a[1] = a[3] = m;
		for(ll i = 1 ; i <= n ; i++){
			scanf("%s", c[i] + 1);
			for(ll j = 1 ; j <= m ; j++)
				if(c[i][j] == '#'){
					a[0] = min(a[0], i - 1);
					a[2] = min(a[2], n - i);
					a[1] = min(a[1], j - 1);
					a[3] = min(a[3], m - 1);
				}
		}
		if(w <= 100 && l <= 100){
			memset(vis, 0, sizeof vis);
			for(int i = 1 ; i <= w - n ; i++)
				for(int j = 1 ; j <= l - m ; j++)
					for(int k = i ; k <= i + n ; k++)
						for(int l = j ; l <= j + m ; l++)
							vis[k][l] |= (c[k - i + 1][l - j + 1] == '#');
			int ans = 0;
			for(int i = 1 ; i <= w ; i++)
				for(int j = 1 ; j <= l ; j++){
					ans += vis[i][j];
					//cerr << vis[i][j] << " \n"[j == l];
				}
			printf("%lld\n", ans);
			continue;
		}
	}
	return 0;
}