#include <bits/stdc++.h>
using namespace std;
struct position{
    int x,y;
    position(int X = 0,int Y = 0){
        x = X;
        y = Y;
    }
    bool operator < (const position it) const {
        if(x == it.x){
            return y < it.y;
        }
        return x < it.x;
    }
    bool operator == (const position it) const {
        return x == it.x && y == it.y;
    }
};
struct node{
    position src,dst;
    bool operator < (const node it) const {
        if(src == it.src){
            return dst < it.dst;
        }
        return src < it.src;
    }
    bool operator == (const node it) const {
        return src == it.src && dst == it.dst;
    }
};
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
vector<string>mp;
map<node,node>vis;
map<node,bool>flag;
int n,m;

void bfs(node start){
    queue<node>q;
    q.push(start);
    vis[start] = start;
    flag[start] = false;
    while(!q.empty()){
        node pre = q.front();
        q.pop();
        for(int k = 0;k < 4;k++){
            node now = pre;
            now.src.x += dx[k];
            now.src.y += dy[k];
            if(now.src.x < 0 || now.src.x >= n || now.src.y < 0 || now.src.y >= m || mp[now.src.x][now.src.y] == 'O'){
                continue;
            }
            now.dst.x += dx[k];
            now.dst.y += dy[k];
            if(now.dst.x < 0 || now.dst.x >= n || now.dst.y < 0 || now.dst.y >= m || mp[now.dst.x][now.dst.y] == 'O'){
                flag[start] = true;
                continue;
            }
            if(vis.count(now)){
                continue;
            }
            vis[now] = start;
            q.push(now);
        }
    }
}

bool check(position now){
    for(int i = 0;i < n;i++){
        for(int j = 0;j < m;j++){
            if(mp[i][j] == 'O'){
                continue;
            }
            if(i == now.x && j == now.y){
                continue;
            }
            node it = {now,position(i,j)};
            if(vis.count(it) <= 0){
                bfs(it);
            }
            if(!flag[vis[it]]){
                return false;
            }
        }
    }
    return true;
}

int solve(){
    cin >> n >> m;
    mp = vector<string>(n);
    for(int i = 0;i < n;i++){
        cin >> mp[i];
    }
    vis.clear();
    flag.clear();
    int ans = 0;
    for(int i = 0;i < n;i++){
        for(int j = 0;j < m;j++){
            if(mp[i][j] == 'O'){
                continue;
            }
            position now(i,j);
            ans += check(now);
        }
    }
    return ans;
}

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;
}