#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 3e3 + 10;
int N,M,K,Q;
int a[MAXN];
vector<int> f[MAXN];
char str[MAXN];
int dp[MAXN * MAXN];
queue<int> q;

struct State{
    int a,b,x,y;
    State(){}
    State(int a1,int a2,int a3,int a4){
        a = a1;b = a2;x = a3;y = a4;
    }
};

int toInt(State state){
    int ret = state.a;
    ret *= M; ret += state.b;
    ret *= N; ret += state.x;
    ret *= M; ret += state.y;
    return ret;
}

int toInt(int a,int b,int x,int y){
    int ret = a;
    ret *= M; ret += b;
    ret *= N; ret += x;
    ret *= M; ret += y;
    return ret;
}

State toState(int x){
    State state;
    state.y = x % M; x /= M;
    state.x = x % N; x /= N;
    state.b = x % M; x /= M;
    state.a = x;
    return state;
}

void prepare(){
    scanf("%lld %lld",&N,&M);
    for(int i = 1;i <= N; i++){
        scanf("%s",str);
        f[i].push_back(0);
        for(int j = 0;j < M; j++){
            if(str[j] == '.') f[i].push_back(1);
            else f[i].push_back(0);
        }
        f[i].push_back(0);
    }
    for(int j = 0;j < M + 2; j++) f[0].push_back(0);
    for(int j = 0;j < M + 2; j++) f[N+1].push_back(0);
    N += 2; M += 2;
    for(int i = 0;i < N; i++){
        for(int j = 0;j < M; j++){
            for(int a = 0;a < N; a++){
                for(int b = 0;b < M; b++){
                    if(f[i][j] == 1 && f[a][b] == 0){
                        State state(i,j,a,b);
                        int u = toInt(state);
                        dp[u] = 1;
                        q.push(u);
                    }
                }
            }
        }
    }
    while(!q.empty()){
        int u = q.front();q.pop();
        auto [a,b,x,y] = toState(u);
        if(a > 0 && x > 0 && f[a-1][b]){
            int v = toInt(a-1,b,x-1,y);
            if(!dp[v]){
                dp[v] = 1;
                q.push(v);
            }
        }
        if(a < N - 1 && x < N - 1 && f[a+1][b]){
            int v = toInt(a+1,b,x+1,y);
            if(!dp[v]){
                dp[v] = 1;
                q.push(v);
            }
        }
        if(b > 0 && y > 0 && f[a][b-1]){
            int v = toInt(a,b-1,x,y-1);
            if(!dp[v]){
                dp[v] = 1;
                q.push(v);
            }
        }
        if(b < M - 1 && y < M - 1 && f[a][b+1]){
            int v = toInt(a,b+1,x,y+1);
            if(!dp[v]){
                dp[v] = 1;
                q.push(v);
            }
        }
    }
    int ans = 0;
    for(int i = 0;i < N; i++){
        for(int j = 0;j < M; j++){
            int flag = 1;
            for(int a = 0;a < N; a++){
                for(int b = 0; b < M; b++){
                    if(a == i && b == j) continue;
                    flag &= dp[toInt(i,j,a,b)];
                }
            }
            ans += flag;
        }
    }
    printf("%lld\n",ans);
    for(int i = 0;i < N; i++) f[i].clear();
    for(int i = 0;i < N * N * M * M; i++) dp[i] = 0;
}

signed main(){
    int T = 1;
    scanf("%lld",&T);
    while(T--){
        prepare();
    }
}