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

using ll = long long;

const int N = 1e3 + 10 + 10;
const int INF = 0x3f3f3f3f;

int t, idx, n, m;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, -1, 1};
char a[N][N];
bool st[N][N];
vector<set<pair<int, int>>> p(N);

void dfs(int x, int y, int k)
{
    st[x][y] = true;
    // cout<<x<<' '<<y<<endl;
    p[k].insert({x, y});
    for (int i = 0; i < 4; i++)
    {
        int tx = x + dx[i], ty = y + dy[i];
        if (tx <= n && tx >= 1 && ty >= 1 && ty <= m && a[tx][ty] == '.' && !st[tx][ty])
            dfs(tx, ty, k);
    }
}

bool check(int l, int r)
{
    vector<pair<int,int>>b;
    pair<int,int>x{0,0};
    for (auto k : p[l])
    {
        if(x.first==0&&x.second==0)
        {
            x=k;
        }
        else
        {
            b.push_back({x.first-k.first,x.second-k.second});
        }
    }
    bool flag=true;
    for(auto k:p[r])
    {
        
        for(auto y:b)
        {
            flag=true;
            if(p[r].count({k.first+y.first,k.second+y.second})==0)
            {
                flag=false;
                break;
            }
        }
    }
    return flag;
}

void solve()
{
    cin >> n >> m;
    idx = 0;

    memset(st, 0, sizeof(st));
    for (int i = 0; i < N; i++)
        p[i].clear();
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            cin >> a[i][j];
        }
    }

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            if (a[i][j] == '.' && !st[i][j])
            {
                dfs(i, j, ++idx);
            }
        }
    }
    // for(int i=1;i<=3;i++)
    //     cout<<p[i].size()<<' ';
    // cout<<endl;
    int res = 0;
    //cout<<"   "<<idx<<endl;
    for (int i = 1; i <= idx; i++)
    {
        bool flag = true;
        //cout<<i<<endl;
        for (int j = 1; j <= idx; j++)
        {
            if(i==j)
                continue;
            if (p[i].size() <= p[j].size())
            {
                flag = false;
                break;
            }
            //cout<<"sss"<<i<<' '<<j<<endl;
            if (check(i, j))
            {
                flag = false;
                break;
            }
        }
        if (flag == true)
            res += p[i].size();
    }
    cout<<res<<endl;
}

int main()
{

    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}