#include<bits/stdc++.h>
using namespace std;
#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 n;
int x1[4000005],y[4000005],x2[4000005],y2[4000005];
int mp[8000005];
int c[200005];
struct item{
	int ql;int qr;int delta;
};
vector<item> l[8000005];
int mp2[8000005];
int val[8000005];
struct node{
	int val,occ,rval;
}seg[8000005*4];
int tag[8000005*4];
node merge(node a,node b){
	if(a.val<b.val)return a;
	if(a.val>b.val)return b;
	return (node){a.val,a.occ+b.occ,a.rval+b.rval};
}
void build(int id,int l,int r){
	if(l==r){seg[id]={0,1,val[l]};return;}
	int mid=(l+r)/2;
	build(id*2,l,mid),build(id*2+1,mid+1,r);
	seg[id]=merge(seg[id*2],seg[id*2+1]);
}
void pushdown(int id){
	if(!tag[id])return;
	tag[id*2]+=tag[id],tag[id*2+1]+=tag[id];
	seg[id*2].val+=tag[id],seg[id*2+1].val+=tag[id];
	tag[id]=0;
}
void modify(int id,int l,int r,int ql,int qr,int d){
	if(l==ql&&r==qr){seg[id].val+=d;tag[id]+=d;return;}
	pushdown(id);
	int mid=(l+r)/2;
	if(qr<=mid)modify(id*2,l,mid,ql,qr,d);
	else if(ql>mid)modify(id*2+1,mid+1,r,ql,qr,d);
	else modify(id*2,l,mid,ql,mid,d),modify(id*2+1,mid+1,r,mid+1,qr,d);
	seg[id]=merge(seg[id*2],seg[id*2+1]);
}
int w,L,v,m;
char s[2005][2005];
void solve(){
	w=read(),L=read(),v=read(),m=read();
	for(int i=1;i<=v;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();
	}
	//i<=x<=w-n+i j<=y<=l-m+j
	n=0;
	vector<int> lsh;
	for(int i=1;i<=v;i++){
		for(int j=1;j<=m;j++){
			if(s[i][j]=='#'){
				++n;
				x1[n]=i,y[n]=j-1,x2[n]=w-v+i+1,y2[n]=L-m+j;
				//cout<<x1[n]<<" "<<y[n]<<" "<<x2[n]<<" "<<y2[n]<<"\n";
				lsh.push_back(x1[n]);
				lsh.push_back(x2[n]);
			}
		}
	}
	if(!n){printf("0\n");return;}
	sort(lsh.begin(),lsh.end());
	for(int i=1;i<=2*n;i++)mp[i]=0;
	for(int i=1;i<=n;i++){
		int v=lower_bound(lsh.begin(),lsh.end(),x1[i])-lsh.begin()+1;
		mp[v]=x1[i];
		x1[i]=v;
		v=lower_bound(lsh.begin(),lsh.end(),x2[i])-lsh.begin()+1;
		mp[v]=x2[i];
		x2[i]=v;
	}
	lsh.clear();
	for(int i=1;i<=n;i++){
		lsh.push_back(y[i]);lsh.push_back(y2[i]);
	}
	sort(lsh.begin(),lsh.end());
	for(int i=1;i<=2*n;i++)mp2[i]=0;
	for(int i=1;i<=n;i++){
		int v=lower_bound(lsh.begin(),lsh.end(),y[i])-lsh.begin()+1;
		mp2[v]=y[i];
		y[i]=v;
		v=lower_bound(lsh.begin(),lsh.end(),y2[i])-lsh.begin()+1;
		mp2[v]=y2[i];
		y2[i]=v;
	}
	for(int i=1;i<=2*n;i++)l[i].clear();
	for(int i=1;i<=n;i++){
		l[x1[i]].push_back((item){y[i],y2[i],1});
		l[x2[i]].push_back((item){y[i],y2[i],-1});
	}
	for(int i=1;i<=2*n;i++)val[i]=mp2[i+1]-mp2[i];
	long long res=0;
	vector<int> d;
	for(int i=1;i<=2*n;i++)if(!l[i].empty())d.push_back(i);
	for(int i=1;i<=4*n;i++)tag[i]=0,seg[i].val=seg[i].occ=seg[i].rval=0;
	build(1,1,2*n);
	long long tot=0;for(int i=1;i<=2*n;i++)tot+=val[i];
	for(int i=0;i<(int)d.size()-1;i++){
		int len=mp[d[i+1]]-mp[d[i]];
		for(int j=0;j<(int)l[d[i]].size();j++){
			int ql=l[d[i]][j].ql,qr=l[d[i]][j].qr;
			int delta=l[d[i]][j].delta;
			//cout<<ql<<" "<<qr<<" "<<delta<<"\n";
			if(ql<=qr-1)modify(1,1,2*n,ql,qr-1,delta);
		}
		res+=len*(tot-seg[1].rval);
	}
	cout<<res<<"\n";
}
bool Med;
signed main(){
	//cerr<<(&Med-&Mbe)/1048576.00<<"MB\n";
	int t=read();
	while(t--)solve();
	return 0;
}