#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define For(i,j,k) for (int i=(j);i<=(k);i++)
#define rof(i,j,k) for (int i=(j);i>=(k);i--)
#define ull unsigned long long
#define lowbit(x) ((x)&(-(x)))
#define PII pair<int,int>
#define int long long
#define endl "\n"
#define ls rt<<1
#define rs rt<<1|1
typedef long long ll;
const int mod = 998244353;
const double eps = 1e-9;
const int N=5e3+7;
int n,m;
int mp[N][N];
int vis[N][N];
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
void solve(){
	cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            char c;
            cin>>c;
            if(c=='.') mp[i][j]=1;
            else mp[i][j]=0;
            vis[i][j]=0;
        }
    }
    int idx=0;
    int ans=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(vis[i][j]==0&&mp[i][j]==1){
                queue<PII> q;
                while(!q.empty()) q.pop();
                vector<PII> path;
                path.clear();
                ++idx;
                vis[i][j]=idx;
                q.push({i,j});
                path.push_back({0,0});
                while(!q.empty()){
                    PII top=q.front();
                    //path.push_back({top.first-i,top.second-j});
                    //q.pop();
                    for(int kk=0;kk<4;kk++){
                        int nex=top.first+dx[kk];
                        int ney=top.second+dy[kk];
                        if(nex>=1&&nex<=n&&ney>=1&&ney<=m&&vis[nex][ney]==0&&mp[nex][ney]==1){
                            vis[nex][ney]=idx;
                            q.push({nex,ney});
                            path.push_back({nex-i,ney-j});
                        }
                    }
                    q.pop();
                    //
                }
                //cout<<"!"<<endl;
                int len=path.size();
                int flag=0;
                for(int ii=1;ii<=n&&!flag;ii++){
                    for(int jj=1;jj<=m&&!flag;jj++){
                        if(vis[ii][jj]==idx||mp[ii][jj]==0) continue;
                        int cnt=0;
                        for(int z=0;z<len;z++){
                            int nex=ii+path[z].first;
                            int ney=jj+path[z].second;
                            if(nex<1||nex>n||ney<1||ney>m||mp[nex][ney]==0){
                                cnt=1;
                            }
                        }
                        if(cnt==0){
                            flag=1;
                            break;
                        }
                    }
                }
                if(flag==0) ans+=path.size();
            }
        }
    }
    cout<<ans<<endl;
}
signed main(){
	int t=1;
	cin>>t;
	while(t--){
		solve();
	}
    //system("pause");
}