// 私は猫です

#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define inf 1000000000
#define infll 1000000000000000000ll
#define pii pair<int,int>
#define rep(i,a,b,c) for(int i=(a);i<=(b);i+=(c))
#define per(i,a,b,c) for(int i=(a);i>=(b);i-=(c))
#define F(i,a,b) for(int i=(a);i<=(b);i++)
#define dF(i,a,b) for(int i=(a);i>=(b);i--)
#define wh(lzm) while(lzm--)
#define cmh(sjy) while(sjy--)
#define lowbit(x) (x&(-x))
#define HH printf("\n")
#define eb emplace_back
using namespace std;
ll read(){
	ll x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return x*f;
}
const int mod=998244353,maxn=200005;
inline void chkmax(int &x,int y){ x=max(x,y); }
inline void chkmin(int &x,int y){ x=min(x,y); }
int n,m,id[105][105];
char a[105][105];
namespace flow{
	int tot=1,to[maxn],w[maxn],hd[maxn],nxt[maxn],N;
	void add(int u,int v,int x){
	    to[++tot]=v,w[tot]=x,nxt[tot]=hd[u],hd[u]=tot;
	}
	void addedge(int u,int v,int x){
		add(u,v,x),add(v,u,0);
	}
	int now[maxn],d[maxn],S,T;
	int bfs(){
	    queue<int>q; q.push(S);
	    F(i,1,N) d[i]=inf;
	    d[S]=0,now[S]=hd[S];
	    while(!q.empty()){
	        int u=q.front();
	        q.pop();
	        for(int i=hd[u];i;i=nxt[i]){
	            int v=to[i],x=w[i];
	            if(x>0&&d[v]>=inf){
	                q.push(v);
	                now[v]=hd[v],d[v]=d[u]+1;
	                if(v==T) return 1;
	            }
	        }
	    }
	    return 0;
	}
	int dfs(int u,int sum){
	    if(u==T||!sum) return sum;
	    int k=0,fl=0;
	    for(int i=now[u];i;i=nxt[i]){
	        now[u]=i;
	        int v=to[i],x=w[i];
	        if(x>0&&d[v]==d[u]+1){
	            k=dfs(v,min(sum-fl,x));
	            w[i]-=k;
	            w[i^1]+=k;
	            fl+=k;
	            if(fl==sum) return fl;
	        }
	    }
	    if(!fl) d[u]=inf;
	    return fl;
	}
	void clear(){
		F(i,0,N) now[i]=hd[i]=0;
		F(i,1,tot) nxt[i]=w[i]=to[i]=0;
		tot=1;
	}
	int dinic(){
	    int ans=0;
	    for(;bfs();){
	    	for(;;){
	    		int x=dfs(S,inf);
	    		if(!x) break;
	    		ans+=x;
	    	}
	    }
	    return ans;	
	}
	void check(){
		F(i,1,N) for(int j=hd[i];j;j=nxt[j]) cout<<i<<' '<<to[j]<<' '<<w[j]<<endl;
	}
}
using namespace flow;
void solve(){
	n=read(),m=read(),N=0;
	F(i,0,n+1) scanf("%s",a[i]+1);
	F(i,0,n+1) F(j,1,m) id[i][j]=++N;
	S=++N,T=++N,clear();
	F(i,1,m) if(a[0][i]=='*') addedge(S,id[0][i],1);
	F(i,1,m) if(a[n+1][i]=='*') addedge(id[n+1][i],T,1);
	F(i,1,n) F(j,1,m) if(a[i][j]=='.'){
		if(j!=m&&a[i][j+1]=='.') addedge(id[i][j],id[i][j+1],1),addedge(id[i][j+1],id[i][j],1);
		if(i!=n&&a[i+1][j]=='.') addedge(id[i][j],id[i+1][j],1),addedge(id[i+1][j],id[i][j],1); 
	}
	F(i,1,m) if(a[0][i]=='*'&&a[1][i]=='.') addedge(id[0][i],id[1][i],1);
	F(i,1,m) if(a[n+1][i]=='*'&&a[n][i]=='.') addedge(id[n][i],id[n+1][i],1);
	printf("%d\n",dinic());
}
signed main(){
	int sjy=read();
	cmh(sjy) solve();
}