#include "bits/stdc++.h"
using namespace std;
const int N = 1e3+10;
int mp[N][N];
int n,m;
int _x[]={1,0,-1,0};
int _y[]={0,1,0,-1};

struct dsu{
    vector<int> fa,rk;

    void init(int x){
        fa.resize(x+1);
        rk.resize(x+1);
        for(int i = 1 ; i <= x ; ++i){
            fa[i] = i;
            rk[i] = 1;
        }
    }

    int zh(int a,int b){
        return a*(m+2)+b;
    }

    int find(int x){return x==fa[x]? x:fa[x] = find(fa[x]);}
    void merge(int a,int b){
        int x= find(a),y = find(b);
        if(x==y)return;
        if(rk[x]>rk[y])swap(x,y);
        fa[x] = y;
        rk[y] += rk[x];
    }

};


int check2(int x,int y,vector<pair<int,int> > &vc){

    for(auto [u,v]:vc){
        int nx = x + u;
        int ny = y + v;
        if(nx<1||nx>n||ny<1||ny>m){
            return 1;
        }
        if(mp[nx][ny]==0)return 1;
    }
    return 0;
}

int check(int i,int j){

    vector<pair<int,int> > vc;
    queue<pair<int,int> > qe;
    qe.push({i,j});

    vector<vector<int> > vis(n+2,vector<int>(m+2));

    while (!qe.empty()){
        auto [u,v] = qe.front();qe.pop();
        vc.push_back({u-i,v-j});

        for(int i = 0 ; i< 4;++i){
            int nx = u+_x[i];
            int ny = v+_y[i];
            if(nx<1||nx>n||ny<1||ny>m)continue;
            if(mp[nx][ny]==0)continue;
            if(vis[nx][ny])continue;
            vis[nx][ny] =1;
            qe.push({nx,ny});
        }
    }

    for(int x = 1; x <= n ;++x){
        for(int y = 1; y <= m ;++y){
            if(x==i&&y==j)continue;
            if(mp[x][y]==1){
                if(!check2(x,y,vc)){
                    return 0;
                }

            }
        }
    }



    return 1;
}

void work(){
    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;
        }
    }
    for(int i = 0; i <= n+1 ; ++i)mp[i][0] = mp[i][m+1] = 0;
    for(int j = 0 ; j <= m +1 ; ++j)mp[0][j] = mp[n+1][j] = 0;

    dsu d;d.init((n+2)*(m+2));

    int ans = 0;
    for(int i = 1; i <= n ;++i){
        for(int j = 1; j <= m ; ++j){
            if(mp[i][j]&&mp[i-1][j]){
                d.merge(d.zh(i,j),d.zh(i-1,j));
            }
            if(mp[i][j]&&mp[i][j-1]){
                d.merge(d.zh(i,j),d.zh(i,j-1));
            }
        }
    }

    for(int i = 1;  i<= n ;++i){
        for(int j = 1; j <= m ; ++j){
            if(mp[i][j]&&d.zh(i,j)==d.fa[d.zh(i,j)]){
                if(check(i,j)){
                    ans += d.rk[d.zh(i,j)];
                }
            }
        }
    }


    cout<<ans<<'\n';

}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int t;cin>>t;
    while(t--){
        work();
    }
    return 0;
}