#include <iostream>
#include <cstdio>
#include <vector>
#define N 1000

using namespace std;

int T, n, m;
int vis[1005][1005], nocan[2005][2005];
char s[1005][1005];

int dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

vector<pair<int, int> > vec, kan;

void dfs(int x, int y) {
    vis[x][y] = 1;
    vec.push_back(make_pair(x, y));
    for(int i = -n; i <= n; ++i) {
        for(int j = -m; j <= m; ++j) {
            int xx = x + i, yy = y + j;
            if(xx < 1 || xx > n || yy < 1 || yy > m || s[xx][yy] == 'O') {
                nocan[i + N][j + N] = 1;
            }
        }
    }
    for(int i = 0; i < 4; ++i) {
        int xx = x + dir[i][0], yy = y + dir[i][1];
        if(xx >= 1 && xx <= n && yy >= 1 && yy <= m && !vis[xx][yy] && s[xx][yy] == '.')  {
            dfs(xx, yy);
        }
    }
}

int main() {
    scanf("%d", &T);
    while(T--) {
        scanf("%d%d", &n, &m);
        kan.clear();
        for(int i = 1; i <= n; ++i) {
            scanf("%s", s[i] + 1);
            for(int j = 1; j <= m; ++j) {
                vis[i][j] = 0;
                if(s[i][j] == '.') kan.push_back(make_pair(i, j));
            }
        }
        int ans = 0;
        for(int i = 1; i <= n; ++i) {
            for(int j = 1; j <= m; ++j) {
                if(s[i][j] == '.' && !vis[i][j]) {
                    for(int ii = -n; ii <= n; ++ii) {
                        for(int jj = -m; jj <= m; ++jj) {
                            nocan[ii + N][jj + N] = 0;
                        }
                    }
                    vec.clear();
                    dfs(i, j);
                    for(int k = 0; k < (int)vec.size(); ++k) {
                        int x0 = vec[k].first, y0 = vec[k].second;
                        int fl = 1;
                        for(int l = 0; l < (int)kan.size(); ++l) {
                            int x1 = kan[l].first, y1 = kan[l].second;
                            if((x1 != x0 || (y1 != y0)) && !nocan[x1 - x0 + N][y1 - y0 + N]) {
                                fl = 0; break;
                            }
                        }
                        if(fl) ++ans;
                    }   
                }
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}