#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

const int maxn = 1e3 + 10;

int n, m;

char s[maxn][maxn];

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

struct node
{
    int x1, y1, x2, y2;
};

void solvet()
{
    cin >> n >> m;
    for (int i = 0; i <= n + 1; i++)
        for (int j = 0; j <= m + 1; j++)
            s[i][j] = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> s[i][j];
    vector f(n + 3, vector(m + 3, vector(n + 3, vector(m + 3, 0))));
    auto vis = f;
    for (int i = 0; i <= n + 1; i++)
        for (int j = 0; j <= m + 1; j++)
            for (int k = 0; k <= n + 1; k++)
                for (int l = 0; l <= m + 1; l++)
                    f[i][j][k][l] = vis[i][j][k][l] = 0;
    queue<node> q;
    auto ok = [&](int x, int y) { return x >= 1 && x <= n && y >= 1 && y <= m && s[x][y] == '.'; };
    // cerr << "?" << endl;
    for (int i = 0; i <= n + 1; i++)
        for (int j = 0; j <= m + 1; j++)
            for (int k = 0; k <= n + 1; k++)
                for (int l = 0; l <= m + 1; l++)
                    if (ok(i, j) && !ok(k, l))
                        for (int o = 0; o < 4; o++)
                        {
                            int ni = i + dx[o], nj = j + dy[o];
                            int nk = k + dx[o], nl = l + dy[o];
                            if (ok(ni, nj) && ok(nk, nl))
                                f[ni][nj][nk][nl] = 1, q.push({ni, nj, nk, nl}), vis[ni][nj][nk][nl] = 1;
                        }
    // cerr << "?" << endl;
    while (!q.empty())
    {
        auto o = q.front();
        q.pop();
        int x1 = o.x1, y1 = o.y1, x2 = o.x2, y2 = o.y2;
        // cerr << "?" << x1 << y1 << x2 << y2 << endl;
        for (int i = 0; i < 4; i++)
        {
            int nx1 = x1 + dx[i], ny1 = y1 + dy[i];
            int nx2 = x2 + dx[i], ny2 = y2 + dy[i];
            if (ok(nx1, ny1) && ok(nx2, ny2))
            {
                f[nx1][ny1][nx2][ny2] = 1;
                if (!vis[nx1][ny1][nx2][ny2])
                    q.push({nx1, ny1, nx2, ny2}), vis[nx1][ny1][nx2][ny2] = 1;
            }
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            if (ok(i, j))
            {
                int flag = 1;
                int cnt = 0;
                for (int k = 1; k <= n; k++)
                    for (int l = 1; l <= m; l++)
                        if (ok(k, l) && (k != i || l != j))
                            flag &= f[i][j][k][l], cnt++;
                ans += cnt == 0 || flag;
            }
    cout << ans << '\n';
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
        solvet();
}