#include <bits/stdc++.h>
using namespace std;

#define qmx(a,b) a<b?b:a
#define qmn(a,b) a>b?b:a
#define ll long long
#define fr first
#define se second
#define pir pair< pair<int, int>, pair<int, int> > 

const int mxn = 1e3+3;

char mp[mxn][mxn];

int n, m, cntn;

pair<int, int> xyz[mxn];

map < pir , bool > res, vis;

struct node{
    int dx;
    int dy;
    int sx;
    int sy;
}que[mxn * mxn], tmp;

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

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

bool outBound(int inx, int iny){
    return inx < 1 || iny < 1 || inx > n || iny > m;
}

void dodel(int dx, int dy, int sx, int sy){
    pir XYZ;
    int tl = 0, hd = 0;
    tl++;
    que[tl].dx = dx;
    que[tl].dy = dy;
    que[tl].sx = sx;
    que[tl].sy = sy;
    while(tl != hd){
        hd++;
        for(int i = 0 ; i < 4 ; i++){
            tmp.dx = que[hd].dx + gx[i];
            tmp.dy = que[hd].dy + gy[i];
            tmp.sx = que[hd].sx + gx[i];
            tmp.sy = que[hd].sy + gy[i];
            if(!(outBound(tmp.dx, tmp.dy) || mp[tmp.dx][tmp.dy] == 'O')){
                XYZ = make_pair(make_pair(tmp.dx, tmp.dy), make_pair(tmp.sx, tmp.sy));
                if(!vis[XYZ]){
                    vis[XYZ] = true;
                    res[XYZ] = true;
                    tl++;
                    que[tl] = tmp;
                }
            }
        }
    }
}

bool trydel(int dx, int dy, int sx, int sy, int step){
    pir XYZ = make_pair(make_pair(dx, dy), make_pair(sx, sy));
    if(vis[XYZ]){
        return res[XYZ];
    }
    vis[XYZ] = true;
    if(outBound(dx, dy) || mp[dx][dy] == 'O'){
        return (res[XYZ] = false);
    }
    if(outBound(sx, sy) || mp[sx][sy] == 'O'){
        return (res[XYZ] = true);
    }
    bool r[4] = {false, false, false, false};
    res[XYZ] = false;
    r[0] = trydel(dx - 1, dy, sx - 1, sy, step + 1);
    if(r[0]){
        res[XYZ] = true;
        goto fun;
    }
    r[1] = trydel(dx, dy - 1, sx, sy - 1, step + 1);
    if(r[1]){
        res[XYZ] = true;
        goto fun;
    }
    r[2] = trydel(dx + 1, dy, sx + 1, sy, step + 1);
    if(r[2]){
        res[XYZ] = true;
        goto fun;
    }
    r[3] = trydel(dx, dy + 1, sx, sy + 1, step + 1);
    if(r[3]){
        res[XYZ] = true;
        goto fun;
    }
    if(step && !res[XYZ])
        vis[XYZ] = false;
    if(res[XYZ]){
        fun:
        dodel(dx, dy, sx, sy);
    }
    return res[XYZ];
}

inline int rd(){
    char c = getchar();
    while(!isdigit(c))
        c = getchar();
    int x = c - '0';
    c = getchar();
    while(isdigit(c)){
        x = x * 10 + (c - '0');
        c = getchar();
    }
    return x;
}

inline void print(int x){
    if(!x){
        putchar('0');
        putchar('\n');
        return;
    }
    char lx[10], len = 0;
    while(x){
        len++;
        lx[len] = x % 10;
        x /= 10;
        //len++;
    }
    while(len){
        putchar('0' + lx[len]);
        len--;
    }
    putchar('\n');
}

inline char getmp(){
    char c = getchar();
    while(c != '.' && c != 'O')
        c = getchar();
    return c;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    bool fail;
    int test, ans;
    test = rd();
    while(test--){
        cntn = 0;
        ans = 0;
        vis.clear();
        res.clear();
        n = rd();
        m = rd();
        for(int i = 1 ; i <= n ; i++){
            for(int j = 1 ; j <= m ; j++){
                //cin >> mp[i][j];
                mp[i][j] = getmp();
                if(mp[i][j] == '.'){
                    xyz[cntn] = make_pair(i, j);
                    cntn++;
                }
            }
        }
        for(int i = 0 ; i < cntn ; i++){
            fail = false;
            for(int j = 0 ; j < cntn ; j++){
                if(i != j){
                    if(!trydel(xyz[i].first, xyz[i].second, xyz[j].first, xyz[j].second, 0)){
                        fail = true;
                        break;
                    }
                }
            }
            if(!fail){
                ans++;
            }
        }
        //cout << ans << "\n";
        print(ans);
    }
    return 0;
}