#include <bits/stdc++.h>

#define ll long long
#define endl "\n"
#define __count __builtin_popcountll
#define yes cout<<"Yes\n";
#define no cout<<"No\n";
using namespace std;
ll fe, cnt;

void solve() {
    ll n, m;
    cin >> n >> m;

    std::vector<std::string> s(n);
    for (int i = 0; i < n; ++i) {
        cin >> s[i];
    }
    if (fe == 50) {
        if (++cnt == 28) {
            cout << n << " " << m << endl;
            for (int i = 0; i < n; ++i) {
                cout << s[i] << endl;
            }
        } else return;
    }

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

    std::vector vis(n, std::vector<ll>(m));

    std::vector<std::vector<ll>> e;
    auto f = e;
    std::map<std::vector<ll>, ll> mp;

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (s[i][j] == 79 || vis[i][j]) continue;
            std::vector<ll> a;

            auto dfs = [&](auto &&self, ll X, ll Y) -> void {
                vis[X][Y] = 1;
                a.push_back(X * m + Y);
                for (int i = 0; i < 4; ++i) {
                    ll x = dx[i] + X;
                    ll y = dy[i] + Y;
                    if (x < 0 || x >= n || y < 0 || y >= m || s[x][y] == 79 || vis[x][y]) {
                        continue;
                    }
                    self(self, x, y);
                }
            };
            dfs(dfs, i, j);

            sort(a.begin(), a.end());
//            cerr << "now " << i << " " << j << endl;
//            for (auto x: a) cerr << x << " \n"[x == a.back()];
//            for (auto x: a) cerr << x / m + 1 << " " << x % m + 1 << endl;
//            cerr << endl;
            ll old = a[0];
            for (auto &x: a) x -= old;
//            for (auto x: a) cerr << x << " \n"[x == a.back()];
//            for (auto x: a) cerr << x / m + 1 << " " << x % m + 1 << endl;
            mp[a]++;
//            cerr << endl;
            e.push_back(a);
        }
    }

    for (auto x: e) {
        if (mp[x] <= 1) f.push_back(x);
    }
    e = f;

    sort(e.begin(), e.end(), [&](std::vector<ll> a, std::vector<ll> b) {
        return a.size() < b.size();
    });
//    for (auto now: e) for (auto x: now) cerr << x << " \n"[x == now.back()];
//    for (auto now: e) for (auto x: now) cerr << x / m + 1 << " " << x % m + 1 << endl;


    ll ans = 0;
    for (int i = 0; i < e.size(); ++i) {
        ll flag = 0, tot = 0;
        auto &now = e[i];
        for (int j = i + 1; j < e.size(); ++j) {
            for (int k = 0; k < e[j].size(); ++k) {
                tot = 0;
                for (int l = k; l < e[j].size(); ++l) {
                    if (e[j][l] - now[tot] == e[j][k] - now[0]) {
                        tot++;
                        if (tot == now.size()) {
                            flag = 1;
                            break;
                        }
                    }
                }
            }
        }

        if (flag == 0) ans += e[i].size();
    }

    cout << ans << endl;
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    ll t = 1;
    cin >> t;
    fe = t;
    while (t--)
        solve();
}