#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

bitset<1010>st[2020][2020];

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while(t--) {
        int n,m;
        cin >> n >> m;
        vector<string>s(n);
        for(int i = 0; i < n; i++) {
            cin >> s[i];
        }
        for(int i = 0; i <= 2*n; i++) {
            for(int j = 0; j <= 2*m; j++) {
                bitset<1010>a;
                st[i][j] = a;
            }
        }
        vector<vector<vector<pair<int,int>>>>tmp(n,vector<vector<pair<int,int>>>(m));
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < m; j++) {
                if(s[i][j] == 'O') continue;
                vector<vector<int>>dist(n,vector<int>(m,-1));
                dist[i][j] = 0;
                queue<pair<int,int>>que;
                que.push({i,j});
                while(!que.empty()) {
                    auto a = que.front();
                    que.pop();
                    for(int k = 0; k < 4; k++) {
                        int nx = a.first+dx[k];
                        int ny = a.second+dy[k];
                        if(nx >= 0 && ny >= 0 && nx < n && ny < m && dist[nx][ny] == -1 && s[nx][ny] == '.') {
                            dist[nx][ny] = 0;
                            que.push({nx,ny});
                        }
                    }
                }
                for(int k = 0; k < n; k++) {
                    for(int l = 0; l < m; l++) {
                        if(dist[k][l] == 0) {
                            tmp[i][j].push_back({n+k-i,m+l-j});
                            st[n+k-i][m+l-j][i*m+j] = 1;
                        }
                    }
                }
            }
        }
        int ans = 0;
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < m; j++) {
                if(s[i][j] == 'O') continue;
                bitset<1010>now;
                for(int k = 0; k < n*m; k++) {
                    now[k] = 1;
                }
                for(auto k:tmp[i][j]) {
                    now &= st[k.first][k.second];
                }
                if(now.count() == 1) {
                    ans++;
                }
            }
        }
        cout << ans << "\n";
    }
}