#include <bits/stdc++.h>

#define rep(i,s,n) for(int i = int(s); i < int(n); i++)
#define rrep(i,s,n) for(int i = int(n) - 1; i >= int(s); i--)
#define all(v) (v).begin(), (v).end()

using ll = long long;
using ull = unsigned long long;
using ld = long double;

bool chmin(auto &a, auto b) {
    if(a <= b) return false;
    a = b;
    return true;
}

bool chmax(auto &a, auto b) {
    if(a >= b) return false;
    a = b;
    return true;
}

using namespace std;

typedef bitset<1010000> B; 

void solve(){
    int n, m; cin >> n >> m;
    vector c(n + 2, vector<char>(m + 2, 'O'));
    rep(i,0,n)rep(j,0,m)cin>>c[i + 1][j + 1];
    n += 2;
    m += 2;

    vector tansaku(n, vector<bool>(m));
    vector belong(n, vector<int>(m, - 1));
    vector<int> siz;
    vector<B> memo;
    int cnt = 0;
    int all_cnt = 0;
    auto valid = [&](int i, int j) -> bool {
        return c[i][j] == '.';
    };

    rep(si,0,n){
        rep(sj,0,m){
            if(valid(si,sj) && !tansaku[si][sj]){
                tansaku[si][sj] = 1;
                vector<pair<int,int>> mada;
                vector<pair<int,int>> mita;
                int tmp_siz = 0;
                mada.push_back(pair(si,sj));
                while(!mada.empty()){
                    auto [i, j] = mada.back();
                    mada.pop_back();
                    tmp_siz++;
                    mita.push_back(pair(i, j));
                    for (auto[x,y]:{
                        pair(i+1,j),pair(i-1,j),pair(i,j+1),pair(i,j-1)
                    }){
                        if(valid(x,y) && !tansaku[x][y]){
                            tansaku[x][y] = 1;
                            mada.push_back(pair(x, y));
                        }
                    }
                }
                all_cnt++;
                if (tmp_siz > 1){
                    B tmp;
                    for (auto[i,j]: mita){
                        tmp[i*m+j] = 1;
                        belong[i][j] = cnt;
                    }
                    memo.emplace_back(tmp);
                    siz.push_back(tmp_siz);
                    cnt++;
                }
            }
        }
    }

    // CORNER CASE
    if (cnt == 0){
        if (all_cnt == 0){
            cout << 0 << '\n';
        }else if(all_cnt == 1){
            cout << 1 << '\n';
        }else{
            cout << 0 << '\n';
        }
        return;
    }

    int ans = 0;
    rep(i,0,n){
        rep(j,0,m){
            if (belong[i][j] == -1) continue;
            int a = belong[i][j];
            bool mode = 1;
            rep(x,0,n){
                rep(y,0,m){
                    if (x == i && y == j) continue;
                    if (belong[x][y] == -1) continue;
                    if (belong[i][j] == belong[x][y]) continue;
                    int idou = (x * m + y) - (i * m + j);
                    int b = belong[x][y];
                    if (idou >= 0){
                        if ((memo[b]|(memo[a]<<idou))==memo[b]){
                            mode = 0;
                            break;
                        }
                    }else{
                        if ((memo[b]|(memo[a]>>(-idou)))==memo[b]){
                            mode = 0;
                            break;
                        }
                    }
                }
                if (!mode){
                    break;
                }
            }
            if (mode){
                ans++;
            }
        }
    }

    cout << ans << '\n';
}

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

    int t; cin >> t;
    while(t--) solve();
}