#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define MAXA(x, y) (x) = ((x) > (y)) ? (x) : (y)
#define MINA(x, y) (x) = ((x) < (y)) ? (x) : (y)
#define MAX(x, y) ((x) > (y)) ? (x) : (y)
#define MIN(x, y) ((x) < (y)) ? (x) : (y)
#define ADD(x, y, mod) (x) = (((x)+(y) >= (mod)) ? ((x)+(y) - (mod)) : (((x)+(y) < 0) ? ((x)+(y)+(mod)) : ((x)+(y))) )
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define count1(x) __builtin_popcount(x)
#define endl '\n'
using namespace std;

// lllllllllllll
const int N = 102;

char A[1005][1005];
int n, m;


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

int fix[1005][1005];

bitset<4000>bt[1001];

int base;

void dfs(int x, int y, int a, int b){
    int val = (x-a)*(2*m-1) + (y-b) - base;
    int ind = a*m + b;
    bt[ind][val] = 1;
    fix[x][y] = 1;
    //cout << x << " " << y << " " << a << " " << b << " " << val << endl; 
    for(int i = 0; i < 4; i++){
        int nx = dx[i] + x;
        int ny = dy[i] + y;
        if(nx < 0 || nx >= n || ny < 0 || ny >= m || fix[nx][ny] == 1 || A[nx][ny] == 'O') continue;
        dfs(nx, ny, a, b);
    }

}

void test_case(){
    cin >> n >> m;
    
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            cin >> A[i][j];
        }
    }

    base = (1-n)*(2*m-1) + (1-n);
    
    for(int i = 0; i < n*m; i++){
        bt[i] = 0;
    }

    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            if(A[i][j] == '.'){
                dfs(i, j, i, j);
            }
            for(int t = 0; t < n; t++){
                fill(fix[t], fix[t] + m, 0);
            }
        }
    }

    int answer = 0;
    for(int i = 0; i < n*m; i++){
        if(A[i/m][i%m] != '.') continue;
        bool ok = true;
        for(int j = 0; j < n*m; j++){
            if(A[j/m][j%m] != '.') continue;
            if(i == j) continue;
            if((bt[i] | bt[j]) == bt[j]){
                //cout << i << " " << j << endl;
                ok = false;
                break;
            }
        }
        if(ok) answer++;
    }

    cout << answer << endl;
}

int main(){

    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    int t = 1;
    cin >> t;
    while(t--){
        test_case();
    }
    
}