#include<bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
void ts(){cout<<"IAKIOI\n";}
bool Mbe;
inline int read(){
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
int w,l,n,m;
char s[2005][2005];
int dif[4005][4005];
void solve(){
	w=read(),l=read(),n=read(),m=read();
	for(int i=1;i<=n;i++){
		s[i][1]=getchar();
		while(s[i][1]!='#'&&s[i][1]!='.')s[i][1]=getchar();
		for(int j=2;j<=m;j++)s[i][j]=getchar();
	}
	for(int i=1;i<=2*n+1;i++)for(int j=1;j<=2*m+1;j++)dif[i][j]=0;
	//压缩 n+1~w-n.
	//w-n+1 to n+2
	//压缩 m+1~l-m.
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(s[i][j]=='#'){
				//x1[n]=i,y[n]=j,x2[n]=w-n+i+1,y2[n]=l-m+j+1;
				int f=i,g=j;
				int p=w-n+i;
				if(w>2*n)p-=w,p+=2*n+1;
				int q=l-m+j;
				if(l>2*m)q-=l,q+=2*m+1;
				dif[f][g]++,dif[p+1][q+1]++;
				dif[p+1][g]--,dif[f][q+1]--;
			}
		}
	}
	for(int i=1;i<=2*n+1;i++){
		for(int j=1;j<=2*m+1;j++)dif[i][j]+=dif[i-1][j]+dif[i][j-1]-dif[i-1][j-1];
	}
	int res=0;
	for(int i=1;i<=2*n+1;i++){
		for(int j=1;j<=2*m+1;j++){
			if(!dif[i][j])continue;
			int tmp=1;
			if(w>2*n&&i==n+1)tmp*=(w-2*n);
			if(l>2*m&&j==m+1)tmp*=(l-2*m);
			res+=tmp;
		}
	}
	printf("%lld\n",res);
}
bool Med;
signed main(){
	//cerr<<(&Med-&Mbe)/1048576.00<<"MB\n";
	int t=read();
	while(t--)solve();
	return 0;
}