#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 5005;
int n, m, cnt[N][N];
char s[N][N];
bool vis[N][N];
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
vector<PII> v[N][N];
void dfs(int x, int y, int rx, int ry){
    vis[x][y] = 1;
    v[rx][ry].pb({x, y});
    _rep(i, 0, 3){
        int nx = x + dx[i], ny = y + dy[i];
        if(nx < 1 || ny < 1 || nx > n || ny > m || vis[nx][ny] || s[nx][ny] == 'O') continue;
        dfs(nx, ny, rx, ry);
    }
}
int main(){
    multitest(){
        read(n, m);
        _rep(i, 1, n) scanf("%s", s[i] + 1);
        _rep(i, 1, n){
            _rep(j, 1, m){
                if(s[i][j] == 'O' || vis[i][j]) continue;
                dfs(i, j, i, j);
            }
        }
        int ans = 0;
        _rep(i, 1, n){
            _rep(j, 1, m){
                if(!v[i][j].size()) continue;
                // debug("fuck (%d,%d)\n", i, j);
                bool ok = 1;
                for(auto &[x, y] : v[i][j]){
                    // debug("(%d,%d)\n", x, y);
                    int tx = i - x, ty = j - y;
                    _rep(p, 1, n){
                        _rep(q, 1, m){
                            if(s[p][q] == 'O') continue;
                            if(p + tx >= 1 && p + tx <= n && q + ty >= 1 && q + ty <= m){
                                cnt[p + tx][q + ty]++;
                            }
                        }
                    }
                }
                _rep(p, 1, n) _rep(q, 1, m) if(cnt[p][q] == v[i][j].size() && !(p == i && q == j)) ok = 0;
                if(ok) ans += v[i][j].size();
                _rep(p, 1, n) _rep(q, 1, m) cnt[p][q] = 0;
            }
        }
        _rep(i, 1, n) _rep(j, 1, m) vis[i][j] = 0, v[i][j].clear();
        writeln(ans);
    }    
    return 0;
}