#include<bits/stdc++.h>
#define N 1005
using namespace std;
string s[N];
int xx[4] = {0, 0, 1, -1};
int yy[4] = {1, -1, 0, 0};
int vis[N][N];
int vec[N];
void work(){
    int n, m;
    int tag = 0, ans = 0;
    cin >> n >> m;
    for (int i = 1; i <= n; i++){
        string ss;cin>>ss;
        s[i]="O"+ss;
        for (int j = 1; j <= m; j++) vis[i][j] = 0;
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++) {
            if(vis[i][j]) continue;
            if(s[i][j] == 'O') continue;
            queue<pair<int, int> > q;
            int tot = 0, sum = 1;
            vis[i][j] = ++tag;
            q.push(make_pair(i, j));
            while(!q.empty()) {
                pair<int,int> now=q.front();q.pop();
                int x = now.first, y = now.second;
                //cout << x << " " << y << " " << tag<< endl;
                for (int k = 0; k < 4; k++){
                    int X = x + xx[k], Y = y + yy[k];
                    if((X < 1 || X > n) || (Y < 1 || Y > m)) continue;
                    if(s[X][Y] == 'O') continue;
                    if(vis[X][Y]) continue;
                    vis[X][Y] = tag; q.push(make_pair(X, Y));
                    vec[++tot] = k; sum++;
                }
            }
            bool Flag = 0;
            for (int ii = 1; ii <= n; ii++)
                for (int jj = 1; jj <= m; jj++){
                    int x = ii, y = jj;
                    bool flag = 0;
                    if(s[x][y] == 'O') continue;
                    if(vis[x][y] == tag) continue;
                    for(int k = 1; k <= tot; k++){
                        x += xx[vec[k]]; y += yy[vec[k]];
                        if((x < 1 || x > n) || (y < 1 || y > m)){
                            flag = 1;
                            break;
                        }
                        if(s[x][y] == 'O') {
                            flag = 1;
                            break;
                        }
                    }
                    if(!flag) {
                        Flag = 1;
                        //cout << ii << " " << jj << endl;
                        break;
                    }
                }
            if(!Flag) ans += sum;
        }
    cout << ans << "\n";
}
int main()
{
	cin.tie(0);
	cin.sync_with_stdio(0);
	int t=1;
	cin>>t;
	while(t--)
		work();
	return 0;
}