#include <bits/stdc++.h>
using namespace std;
struct position{
    int x,y,id;
    bool operator < (const position it) const {
        return id < it.id;
    }
};
struct node{
    set<position>st;
    bool operator < (const node it) const {
        return st < it.st;
    }
};
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};

int solve(){
    int n = 0,m = 0;
    cin >> n >> m;
    vector<string>mp(n);
    for(int i = 0;i < n;i++){
        cin >> mp[i];
    }
    node start;
    for(int i = 0;i < n;i++){
        for(int j = 0;j < m;j++){
            if(mp[i][j] == '.'){
                position it;
                it.x = i;
                it.y = j;
                it.id = i * m + j;
                start.st.insert(it);
            }
        }
    }
    queue<node>q;
    q.push(start);
    map<node,bool>vis;
    vis[start] = true;
    set<int>ans;
    while(!q.empty()){
        node pre = q.front();
        q.pop();
        if((int)pre.st.size() == 1){
            ans.insert((*pre.st.begin()).id);
            continue;
        }
        for(int k = 0;k < 4;k++){
            node now;
            for(position it : pre.st){
                position temp = it;
                temp.x += dx[k];
                temp.y += dy[k];
                if(temp.x < 0 || temp.x >= n || temp.y < 0 || temp.y >= m || mp[temp.x][temp.y] == 'O'){
                    continue;
                }
                now.st.insert(temp);
            }
            if((!vis[now]) && (int)now.st.size()){
                vis[now] = true;
                q.push(now);
            }
        }
    }
    return (int)ans.size();
}

signed main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int t = 0;
    cin >> t;
    while(t--){
        int ans = solve();
        cout << ans << endl;
    }
    return 0;
}