#include<iostream>
#include<cstring>
#include<vector>
#include<bitset>
#include<queue>
using namespace std;
using LL = long long;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

const int maxn = 1024;
template <int len = 1>
void solve(int n, int m){
    if (n * m > len){
        solve<min(len * 2, maxn)>(n, m);
        return;
    }
    vector<string> g(n);
    vector<vector<int> > id(n, vector<int>(m, -1));
    int tot = 0;
    for(int i = 0; i < n; i++){
        cin >> g[i];
        for(int j = 0; j < m; j++){
            if (g[i][j] == '.'){
                id[i][j] = tot++;
            }
        }
    }
    if (tot == 0){
        cout << 0 << '\n';
        return;
    }

    vector<vector<bitset<len> > > bs(2 * n + 1, vector<bitset<len> >(2 * m + 1));
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            if (id[i][j] == -1) continue;
            for(int dx = -n; dx <= n; dx++){
                for(int dy = -m; dy <= m; dy++){
                    int x = i + dx, y = j + dy;
                    if (x < 0 || x >= n || y < 0 || y >= m || g[x][y] == 'O'){
                        bs[dx + n][dy + m].set(id[i][j]);
                    }
                }
            }
        }
    }
    vector<vector<bool> > v(n, vector<bool>(m));

    int ans = 0;

    auto bfs = [&](int x, int y){
        queue<pair<int, int> > q;
        q.push({x, y});
        v[x][y] = true;
        vector<pair<int, int> > p;
        while(!q.empty()){
            auto [x, y] = q.front();
            q.pop();
            p.push_back({x, y});
            for(int u = 0; u < 4; u++){
                int nx = x + dx[u], ny = y + dy[u];
                if (nx < 0 || nx >= n || ny < 0 || ny >= m || g[nx][ny] == 'O' || v[nx][ny]) continue;
                v[nx][ny] = true;
                q.push({nx, ny});
            }
        }

        for(auto [x1, y1] : p){
            bitset<len> mask;
            for(auto [x2, y2] : p){
                int xx = x2 - x1, yy = y2 - y1;
                mask |= bs[xx + n][yy + m];
            }
            if (mask.count() == tot - 1){
                ans += 1;
            }
        }

    };

    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            if (id[i][j] != -1 && !v[i][j]){
                bfs(i, j);
            }
        }
    }

    cout << ans << '\n';
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T;
    cin >> T;
    while(T--){
        int n, m;
        cin >> n >> m;
        solve(n, m);
    }

}