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

using ll=long long;

int tt,n,m,xma[(int)1e5+9],yma[(int)1e5+9],xmi[(int)1e5+9],ymi[(int)1e5+9],c[(int)1e3+9][(int)1e3+9];
string s;

int id(int x,int y){return (x-1)*m+y;}

struct dsu{
    vector<int> fa,sz;
    int n;
    dsu(int n):n(n),fa(n+1,0),sz(n+1,1){for(int i=1;i<=n;++i)fa[i]=i;}
    int fnd(int x){return fa[x]==x?x:fa[x]=fnd(fa[x]);}
    void merge(int x,int y){int oa=fnd(x),ob=fnd(y);if(oa!=ob)sz[oa]+=sz[ob],fa[ob]=oa;}
};
const pair<int,int> dirs[]={{1,0},{0,1},{-1,0},{0,-1}};

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>tt;
    while(tt--){
        map<int,vector<bitset<(int)1e3+9>>> mp;
        ll ans=0ll;

        cin>>n>>m;
        dsu d(n*m);
        for(int i=1;i<=n;++i){
            cin>>s;
            for(int j=1;j<=m;++j)c[i][j]=s[j-1]=='.';
        }

        for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)if(c[i][j]){
            int ind=id(i,j);
            xma[ind]=yma[ind]=-1e5,xmi[ind]=ymi[ind]=1e5;
            for(auto [aa,bb]:dirs){
                aa+=i,bb+=j;
                if(1<=aa&&aa<=n&&1<=bb&&bb<=m&&c[aa][bb]){
                    d.merge(ind,id(aa,bb));
                }
            }
        }

        for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)if(c[i][j]){
            int ind=d.fnd(id(i,j));
            xma[ind]=max(xma[ind],i),yma[ind]=max(yma[ind],j);
            xmi[ind]=min(xmi[ind],i),ymi[ind]=min(ymi[ind],j);
        }
        for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)if(c[i][j]&&d.fnd(id(i,j))==id(i,j)){
            int ind=d.fnd(id(i,j));
            mp[ind]=std::move(vector<bitset<(int)1e3+9>>(xma[ind]-xmi[ind]+1));
        }
        for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)if(c[i][j]){
            int ind=d.fnd(id(i,j));
            mp[ind][i-xmi[ind]][j-ymi[ind]]=true;
        }
        for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)if(c[i][j]&&d.fnd(id(i,j))==id(i,j)){
            int ind=d.fnd(id(i,j));
            int dx=xma[ind]-xmi[ind],dy=yma[ind]-ymi[ind];
            //cerr<<i<<"::"<<j<<" "<<dx<<" --- "<<dy<<"\n";
            bool flag=true;
            for(int k=1;k<=n;++k)for(int l=1;l<=m;++l)if(c[k][l]&&d.fnd(id(k,l))==id(k,l)&&d.fnd(id(k,l))!=ind){
                int nind=d.fnd(id(k,l)),ndx=xma[nind]-xmi[nind],ndy=yma[nind]-ymi[nind];
                //cerr<<" -"<<k<<" : "<<l<<" "<< ndx<<" -- "<<ndy<<"\n"; 
                for(int I=0;I+dx<=ndx;++I)for(int J=0;J+dy<=ndy;++J){
                    bool ok=true;
                    for(int K=0;K<=dx;++K){
                        if((mp[ind][K]&(mp[nind][I+K]>>J))!=mp[ind][K])ok=false;
                    }
                    if(ok)flag=false;
                }
            }
            //cerr<<flag<<" !!!\n";
            if(flag)ans+=d.sz[ind];
        }
        cout<<ans<<"\n";





    }
    return 0;
}