#include <bits/stdc++.h>
using namespace std;
int falg[4000006],a[1004][1004],n,m,color[4000006],bfs[10000006][4];
int go[4][2]={0,1,1,0,-1,0,0,-1};
int get(int x,int y,int x1,int y1){
    return x*(m+1)*(m+1)*(n+1)+y*(n+1)*(m+1)+x1*(m+1)+y1;
}
int life(int x,int y){
    if(x>0&&y>0&&x<=n&&y<=m&&a[x][y])return 1;
    return 0;
}
void dfs(int x,int y,int x1,int y1){
    int head=0,tail=0,s=get(x,y,x1,y1);
    bfs[tail][0]=x;
    bfs[tail][1]=y;
    bfs[tail][2]=x1;
    bfs[tail++][3]=y1;
    while(head<tail){
        int x2=bfs[head][0],y2=bfs[head][1],x3=bfs[head][2],y3=bfs[head][3];
        for(int i=0;i<4;i++){
            int x4=x2+go[i][0],y4=y2+go[i][1];
            int x5=x3+go[i][0],y5=y3+go[i][1];
            if(!life(x4,y4))continue;
            if(!life(x5,y5)){
                falg[s]=1;
                continue;
            }
            int now=get(x4,y4,x5,y5);
            if(color[now]!=now)continue;
            color[now]=s;
            bfs[tail][0]=x4;
            bfs[tail][1]=y4;
            bfs[tail][2]=x5;
            bfs[tail++][3]=y5;
        }
        head++;
    }
}
int judge(int x,int y){
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            if(a[i][j]){
                if(x==i&&y==j)continue;
                int s=get(x,y,i,j);
                if(falg[color[s]]==-1){
                    falg[s]=0;
                    dfs(x,y,i,j);
                }
                if(!falg[color[s]])return 0;
            }
    return 1;
}
int main()
{
    int t;
    cin>>t;
    while(t--){
        cin>>n>>m;
        long long ans=0;
        for(int i=1;i<=(n+1)*(m+1)*(m+1)*(n+1);i++)falg[i]=-1,color[i]=i;
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++){
                char s;
                cin>>s;
                if(s=='.')a[i][j]=1;
                else a[i][j]=0;
            }
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
                if(a[i][j]){
                    int l=judge(i,j);
                    ans+=l;
                }
        cout<<ans<<endl;
    }
    return 0;
}