#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef array<int, 3> ai3;
const ll inf = 0x3f3f3f3f3f3f3f3fll;
const int Mod = 998244353;
const int inv[5] = {0, 1, (Mod+1) / 2, (Mod+1) / 3};
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, int p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 111;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
inline void chmax(int &a, int b){ (b>a) ? (a=b) : 0; }
inline void chmin(int &a, int b){ (b<a) ? (a=b) : 0; }

int n, m;
string s[1010];
int dsu[1010]; int getdsu(int u){ return dsu[u] = dsu[u] == u ? u : getdsu(dsu[u]); }
inline int id(int x, int y){ return x*m + y; }
bitset<4040> can[1010];
void solve(){
	cin >> n >> m;
	rep(i, n) cin >> s[i];
	rep(i, n*m) dsu[i] = i;
	rep(i, n) rep(j, m-1) if(s[i][j] == '.' && s[i][j+1] == '.') dsu[getdsu(id(i, j))] = dsu[getdsu(id(i, j+1))];
	rep(i, n-1) rep(j, m) if(s[i][j] == '.' && s[i+1][j] == '.') dsu[getdsu(id(i, j))] = dsu[getdsu(id(i+1, j))];
	rep(i, n) rep(j, m) if(s[i][j] == '.'){
		can[id(i, j)] = 0;
		rep(k, n) rep(l, m) if(getdsu(id(k, l)) == getdsu(id(i, j))){
			//cout << id(i, j) << " " << ((k-i) + n-1) * (2*m) + (l-j) + m-1 << "\n";
			can[id(i, j)][((k-i) + n-1) * (2*m) + (l-j) + m-1] = 1;
		}
		//cout << i << " " << j << ": ";
		//rep(k, 2*n * 2*m) cout << can[id(i, j)][k];
		//rep(k, 2*n * 2*m) cout << can[0][k] << " ";
		//cout << "\n";
	}
	//rep(k, 2*n * 2*m) cout << can[0][k] << " ";
	//cout << "\n";
	int ans = 0;
	rep(i, n) rep(j, m) if(s[i][j] == '.'){
		bool ok = 1;
		rep(k, n) rep(l, m) if(s[k][l] == '.' && (k != i || l != j)){
			//cout << i << " " << j << "  " << k << " " << l << "\n";
			//rep(o, 2*n * 2*m) cout << ((can[id(i, j)]))[o]; cout << "\n";
			//rep(o, 2*n * 2*m) cout << ((can[id(k, l)]))[o]; cout << "\n";
			//rep(o, 2*n * 2*m) cout << ((can[id(i, j)] & can[id(k, l)]))[o]; cout << "\n";
			ok &= ((can[id(i, j)] & can[id(k, l)]) != can[id(i, j)]);
		}
		ans += ok;
	}
	cout << ans << "\n";
}

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

	int T;
	cin >> T;
	while(T--) solve();

	return 0;
}