#include <cstdio>
#include <cstring>
#include <queue>

inline int read(){
    int x = 0, f = 1; char ch = getchar();
    while(ch < '0' || ch > '9'){
        if(ch == '-') f = -1;
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9'){
        x = (x << 3) + (x << 1) + ch - '0';
        ch = getchar();
    }
    return x * f;
}

const int maxn = 1e3 + 5;
// vis[x]: x 所在的连通块。
int n, m, f[maxn * maxn], vis[maxn * maxn];
char g[maxn][maxn];

// 由题 n * m <= 2e3，将四元数组压成一个整数。

int pack(int a, int b, int x, int y){
    return a * m * n * m + b * n * m + x * m + y;
}

void unpack(int msk, int &a, int &b, int &x, int &y){
    a = msk / (m * n * m);
    b = msk / (n * m) % m;
    x = msk / m % n;
    y = msk % m;
}

int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

void bfs(int pkg){
    // 从状态 pkg 开始 bfs。
    f[pkg] = false, vis[pkg] = pkg;
    std::queue <int> q; q.push(pkg);
    while(!q.empty()){
        int a, b, x, y; unpack(q.front(), a, b, x, y); q.pop();
        // printf("[dbg] %d %d %d %d\n", a, b, x, y);
        // 两只袋鼠分别在 (a, b) 和 (x, y)。
        for(int i = 0; i < 4; i++){
            int A = a + dx[i], B = b + dy[i], X = x + dx[i], Y = y + dy[i];
            if(A < 0 || A > n-1 || B < 0 || B > m-1 || g[A][B] == 'O') continue;
            if(X < 0 || X > n-1 || Y < 0 || Y > m-1 || g[X][Y] == 'O'){ f[pkg] = true; continue; }
            int npkg = pack(A, B, X, Y);
            if(vis[npkg] >= 0) continue;
            q.push(npkg); vis[npkg] = pkg;
        }
    }
}

bool check(int a, int b){
    // 位于 (a, b) 的袋鼠是否能够打过其他所有袋鼠。
    for(int x = 0; x < n; x++){
        for(int y = 0; y < m; y++){
            if(g[x][y] == '.' && (x != a || y != b)){
                // printf("[chk] %d %d %d %d\n", a, b, x, y);
                int pkg = pack(a, b, x, y);
                if(!~vis[pkg]) bfs(pkg);
                if(!f[vis[pkg]]) return false;
            }
        }
    }
    return true;
}

void solve(){
    int ans = 0;
    scanf("%d%d", &n, &m);
    memset(vis, -1, sizeof(int) * n * m * n * m + 3);
    for(int i = 0; i < n; i++) scanf("%s", g[i]);
    for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) if(g[i][j] == '.') ans += check(i, j);
    printf("%d\n", ans);
}

int main(){
    int _ = read(); while(_--) solve();
    return 0;
}