#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;


template<typename T>
ostream_iterator<T> oit(const string &s = " "){
    return ostream_iterator<T>(cout,s.c_str());
}
inline auto rep(int l, int r) { return views::iota(min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }
inline auto per(int l, int r) { return rep(l, r) | views::reverse; }
inline auto per(int n) { return per(0, n); }
inline auto per1(int l, int r) { return per(l, r + 1); }
inline auto per1(int n) { return per(1, n + 1); }

inline auto len = ranges::ssize;

struct chash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

template<typename T, typename U> using pb_map = gp_hash_table<T, U, chash>;
template<typename T> using pb_set = gp_hash_table<T, null_type, chash>;
#define K first
#define V second

typedef long long ll;
typedef long double ld;

typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;

constexpr ll NN = 2e5;
constexpr ll M = 1000000007;

ll f1[NN], f2[NN];

ll inv(ll a, ll b=M) { return 1 < a ? b - inv(b % a, a) * b / a : 1; } // inv a mod b
ll choose(ll n, ll k) { return f1[n] * f2[k] % M * f2[n - k] % M; } // n choose k

vector<pii> delta {{1,0},{-1,0},{0,-1},{0,1}};

constexpr int MM = 4001; //4001

void run()
{
    int n,m,ans=0; cin >> n >> m;
    vector<string> grid(n); for(auto &s : grid) cin >> s;
    vector<vector<pii>> kangas; set<pii> offsets; 
    vector<vector<bool>> done(n,vector<bool>(m));

    auto res = [&](){ for(auto &v : done) fill_n(v.begin(),m,false); };
    auto isgood =[&](int i,int j){
        if(i >= n or j >= m or i<0 or j<0) return false;
        return grid[i][j] == '.' and !done[i][j];
    };

    for(int kangaidx=0; int i : rep(n)){
        for(int j : rep(m)){
            if(grid[i][j]!='.') continue; 
            queue<pii> q; q.emplace(i,j),done[i][j]=true, res();
            kangas.push_back({});
            while(!q.empty()){
                auto [x,y] {q.front()}; q.pop();
                offsets.insert({i-x,j-y});
                kangas[kangaidx].emplace_back(i-x,j-y);
                for(int nx,ny; auto [dx,dy] : delta){
                    nx=x+dx,ny=y+dy;
                    if(isgood(nx,ny)) done[nx][ny]=true,q.emplace(nx,ny);
                }                
            }
            // cout << '\t' <<size(kangas[kangaidx]) << '\n'; 
            kangaidx++;
        }
    }

    vector<bitset<MM>> BITSETS(len(kangas));
    map<pii,int> mp; for(int idx=0; auto p : offsets) mp[p]=idx++; //coord compress
    for(int i : rep(len(kangas)))
        for(pii p : kangas[i])
            BITSETS[i][mp[p]] = 1;
    
    for(int i : rep(len(kangas))){
        bool good = true;
        for(int j : rep(0,len(kangas))){
            if(i==j)continue;
            bitset<MM> res = BITSETS[j];
            res = ~res;
            res = res & BITSETS[i];
            good = good and (res.count()>0);
            if(!good) break;
        } ans += good;
    }

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

int main()
{
    //KING OF THE WORLD...... U.W.T.B
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t; cin>>t; while(t--) run();
}