#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include<bits/stdc++.h>
using namespace std;
#define int long long

const int C = 4000;

#define x first
#define y second
int32_t main() {
//#ifdef LOCAL
//    freopen("../A.in", "r", stdin);
//#endif
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t;cin>>t;
    while(t--) {
        int n, m;
        cin >> n >> m;vector <string> a(n);
        for (int i = 0; i < n; ++i) {
            cin >> a[i];
        }
        vector <vector <int> > c(n, vector <int> (m)),s(2*n,vector<int>(2*m));int p = 1;
        auto ok = [&] (int i, int j) {
            if (i < 0 || i >= n || j < 0 ||j >=m || a[i][j]=='O') {
                return false;
            }
            else {
                return true;
            }
        };
        vector <pair <int, int> > v = {{0,1},{0,-1},{1,0},{-1,0}};
        function<void(int,int)>dfs = [&] (int i, int j) {
            if (!ok(i,j) || c[i][j]>0) {
                return;
            }
            c[i][j] = p;
            for (auto [dx, dy] : v) {
                int x = i + dx, y = j + dy;
                dfs(x,y);
            }
        };
        vector <vector <bitset <C> > > b(n, vector <bitset <C>> (m));
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                if (ok(i,j)&&c[i][j]==0) {
                    dfs(i,j);p++;
                }

            }

        }
        /*
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                cout<<c[i][j];

            }
            cout<<endl;
        }
         */
        int ans =0;
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                if (c[i][j]) {
                    for (int x = 0; x < n; ++x) {
                        for (int y = 0; y < m; ++y) {
                            if (c[x][y]==c[i][j]) {
                                int dx = x-i+n;
                                int dy = y-j+m;
                                int num = dx * 2 * m + dy;
                                b[i][j][num] = 1;
                            }
                        }
                    }
                }

            }
        }
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                if (c[i][j]) {
                    int ok = 1;
                    for (int x = 0; x < n&&ok; ++x) {
                        for (int y = 0; y < m; ++y) {
                            if (c[x][y]) {
                                if(x==i&&y==j)continue;
                                if ((b[i][j]&b[x][y])==b[i][j]) {
                                    ok=0;break;
                                }
                            }
                        }
                    }

                    ans += ok;
                }

            }
        }
        cout<<ans<<endl;
    }
    return 0;
}