//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mod = 998244353;
const int N = 1000 + 5;

int n, m;
int col[N][N];
char mp[N][N];
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};

void dfs(int x, int y, const int co) {
    if (mp[x][y] == 'O' || col[x][y]) return;
    col[x][y] = co;
    for (int k = 0; k < 4; k++) {
        int nx = x + dx[k], ny = y + dy[k];
        dfs(nx, ny, co);
    }
}

void MAIN() {
    scanf("%d %d", &n, &m);
    for (int i = 0; i <= n + 1; i++) {
        for (int j = 0; j <= m + 1; j++) {
            col[i][j] = 0;
        }
    }
    for (int i = 1; i <= n; i++) {
        scanf("%s", mp[i] + 1);
    }
    mp[0][0] = mp[n + 1][0] = mp[n + 1][m + 1] = mp[0][m + 1] = 'O';
    for (int i = 1; i <= m; i++) mp[0][i] = mp[n + 1][i] = 'O';
    for (int i = 1; i <= n; i++) mp[i][0] = mp[i][m + 1] = 'O';
    int tot = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) if (!col[i][j]) {
            ++tot;
            dfs(i, j, tot);
        }
    }
    map<pii, bool> del[tot + 1];
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) if (mp[i][j] != 'O') {
            for (int x = 0; x <= n + 1; x++) {
                for (int y = 0; y <= m + 1; y++) if (mp[x][y] == 'O') {
                    del[col[i][j]][{x - i, y - j}] = true;
                }
            }
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) if (mp[i][j] != 'O') {
            int ok = 1;
            for (int x = 1; x <= n; x++) {
                for (int y = 1; y <= m; y++) if (mp[x][y] == '.' && (i != x || j != y)) {
                    if (!del[col[i][j]].count({x - i, y - j})) {
                        ok = 0;
                        break;
                    }
                }
            }
            ans += ok;
        }
    }
    printf("%d\n", ans);
}

int main() {
#ifdef LOCAL
    auto start = chrono::steady_clock::now();
    freopen("miku.in", "r", stdin);
    freopen("miku.out", "w", stdout);
#endif
    //os::sync_with_stdio(0); cin.tie(0);
    int T = 1;
    // cin >> T;
    scanf("%d", &T);
    while (T--) MAIN();
#ifdef LOCAL
    auto end = chrono::steady_clock::now();
    cout << "\nqwq: " <<  chrono::duration_cast<chrono::milliseconds>(end - start).count() << "ms\n";
#endif
    return 0;
}