#include<bits/stdc++.h>
using namespace std;
const int maxn = 1005;
int T, n, m;
int a[maxn][maxn];
int p[maxn][maxn];
struct node {int x, y;};
vector<node> tmp;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int ans;
bool chk(int x, int y) {return x >= 1 && x <= n && y >= 1 && y <= m;}
void dfs(int x, int y, int sx, int sy) {
    tmp.push_back((node){x - sx, y - sy}); p[x][y] = 1;
    for (int i = 0; i < 4; i++) {
        int nx = x + dx[i], ny = y + dy[i];
        if (!chk(x, y) || a[nx][ny] == 0 || p[nx][ny]) continue;
        dfs(nx, ny, sx, sy);
    }
}
bool check(int x, int y) {
    // cout << ":::" << endl;
    // for (auto k : tmp) cout << k.x << ' ' << k.y << endl;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++) {
            if (i == x && j == y) continue;
            bool fl = 1;
            for (auto k : tmp)
                if (!chk(i + k.x, j + k.y) || a[i + k.x][j + k.y] == 0) {fl = 0; break;}
            // if (fl && tmp.size() == 3) {cout << i << ' ' << j << endl;}
            if (fl) return 1;
        }
    // cout << "heige" << endl;
    return 0;
}
void work() {
    cin >> n >> m; ans = 0;
    for (int i = 1; i <= n; i++) {
        string s; cin >> s;
        for (int j = 1; j <= m; j++) a[i][j] = (s[j - 1] == '.'), p[i][j] = 0;
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++) {
            if (a[i][j] == 0 || p[i][j]) continue;
            tmp.clear(); dfs(i, j, i, j);
            if (!check(i, j)) ans += tmp.size();
        }
    cout << ans << '\n';
}
int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> T;
    while (T--) work();
    return 0;
}