#include <bits/stdc++.h>
using namespace std;
int fx[4]={-1,0,1,0};
int fy[4]={0,1,0,-1};
const int N=1e3+4;
template<int LEN>int solve(int n,int m)
{
    if (LEN<n*m){
        return solve<min(N,LEN+10)>(n,m);
    }
    using Bitset=bitset<LEN>;
    vector<string> a(n);
    vector<vector<Bitset>> ans(n*2+2,vector<Bitset>(m*2+2));
    for(int i=0;i<n;i++)cin>>a[i];
    auto in =[&](int x,int y){
        if(x>=0&&x<n&&y>=0&&y<m&&a[x][y]=='.')return true;
        return false;
    };
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++)if(a[i][j]=='.'){
            vector<vector<int>> vis(n,vector<int>(m));
            function<void(int,int)> dfs = [&](int x,int y){
                vis[x][y]=1;
                ans[x-i+n][y-j+m][i*m+j]=1;
                for(int z=0;z<4;z++){
                    int xx=fx[z]+x,yy=fy[z]+y;
                    if(in(xx,yy)&&!vis[xx][yy])dfs(xx,yy);
                }
            };
            dfs(i,j);
        }
    }
    int tot=0;
    Bitset all;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++)if(a[i][j]=='.'){
            all.set();
            vector<vector<int>> vis(n,vector<int>(m));
            function<void(int,int)> dfs = [&](int x,int y){
                vis[x][y]=1;
                all&=ans[x-i+n][y-j+m];
                for(int z=0;z<4;z++){
                    int xx=fx[z]+x,yy=fy[z]+y;
                    if(in(xx,yy)&&!vis[xx][yy])dfs(xx,yy);
                }
            };
            dfs(i,j);
            // cout<<"i="<<i<<" j="<<j<<" ct="<<all.count()<<"\n";
            // cout<<LEN-n*m+1<<"\n";
            if((int)all.count()==1){
                tot+=1;
                // cout<<"i="<<i<<" j="<<j<<"\n";
            }
        }
    }
    return tot;
}
int main()
{
    ios::sync_with_stdio(false);
    // cin.tie(0);
    int T;cin>>T;while(T--){
        // cout<<"/?\n";
        int n,m;cin>>n>>m;
        cout<<solve<1>(n,m)<<"\n";
    }
    return 0;
}