#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

int x[] = {-1, 0, 1, 0};
int y[] = {0, 1, 0, -1};

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<string> g(n + 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> g[i];
        g[i] = " " + g[i];
    }
    vector<vector<bitset<1000>>> mp(
        2 * n + 1, vector<bitset<1000>>(2 * m + 1, bitset<1000>(0)));
    for (int i = 0; i < 2 * n + 1; i++)
    {
        for (int j = 0; j < 2 * m + 1; j++)
        {
            int down = i - n;
            int right = j - m;
            for (int k = 0; k < 1000; k++)
            {
                int row = k / m;
                int col = k % m;
                if (row - down >= 0 && row - down < n && col - right >= 0 &&
                    col - right < m &&
                    g[row - down + 1][col - right + 1] == '.')
                    mp[i][j][k] = true;
                else
                    mp[i][j][k] = false;
            }
            // cout << i << " " << j << " " << mp[i][j] << "\n";
        }
    }

    int ans = 0;
    vector<vector<int>> vis(n + 1, vector<int>(m + 1));
    queue<pair<int, int>> q;
    vector<pair<int, int>> in;
    bitset<1000> bs;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            if (g[i][j] != '.')
                continue;
            if (vis[i][j])
                continue;
            in.clear();
            q.push({i, j});
            while (!q.empty())
            {
                auto [xx, yy] = q.front();
                q.pop();
                if (vis[xx][yy])
                    continue;
                vis[xx][yy] = 1;
                in.emplace_back(xx, yy);
                for (int k = 0; k < 4; k++)
                {
                    if (xx + x[k] >= 1 && xx + x[k] <= n && yy + y[k] >= 1 &&
                        yy + y[k] <= m && g[xx + x[k]][yy + y[k]] == '.')
                        q.emplace(xx + x[k], yy + y[k]);
                }
            }
            for (int k = 0; k < in.size(); k++)
            {
                bs = mp[n][m];
                for (int l = 0; l < in.size(); l++)
                {
                    int xx = -in[l].first + in[k].first;
                    int yy = -in[l].second + in[k].second;
                    bs &= mp[xx + n][yy + m];
                }
                if (bs[(in[k].first - 1) * m + in[k].second - 1] &&
                    bs.count() == 1)
                    ans++;
            }
        }
    }
    cout << ans << "\n";
}

int main()
{
#ifdef lijn
    freopen("/home/lijn/acm_practice/.build/input.in", "r", stdin);
    freopen("/home/lijn/acm_practice/.build/output.out", "w", stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}