#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <algorithm>
#include <cassert>
#include <chrono>
#include <random>
#include <string>
#include <numeric>
#include <complex>
#include <tuple>
#include <utility>
#include <bitset>
#include <array>
#include <stack>
#include <sstream>

using namespace std;
typedef long long ll;
 
string to_string(string a) { return '"' + a + '"'; }
string to_string(char a) { return "'" + string(1, a) + "'"; }
string to_string(const char* a) { return to_string((string) a); }
string to_string(bool a) { return a ? "true" : "false"; }
template <class T1, class T2>
string to_string(pair<T1, T2> a) {
    return "(" + to_string(a.first) + ", " + to_string(a.second) + ")";
}
template <class T>
string to_string(T a) {
    bool first = true; string res = "{";
    for (const auto& i : a) {
        if (!first) res += ", ";
        first = false;
        res += to_string(i);
    }
    res += "}";
    return res;
}
void debug_out() { cerr << endl; }
template <class T1, class... T2>
void debug_out(T1 a, T2... b) {
    cerr << " " << to_string(a);
    debug_out(b...);
}
 
#ifdef LOCAL
#define out(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define out(...) 42
#endif

clock_t start_time; void start_timer() { start_time = clock(); }
double get_time() { return (double) (clock() - start_time) / CLOCKS_PER_SEC; }

void Solve();

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
    freopen("usr/share/man/man1/input.txt", "r", stdin);
#endif
    start_timer();
    Solve();
#ifdef LOCAL
    cerr << fixed << setprecision(3);
    cerr << endl << "Time spent: " << get_time() << endl;
#endif
    return 0;
}

// do something, stay focused
// look for stupid bugs
// guess, slow, stress
// don't overgeneralize
// don't rush

// don't waste time on standings

// SOLVE THE PROBLEM OR DIE TRYING
// THE SOLUTION IS ALWAYS SIMPLE
// THE CODE IS ALWAYS SHORT

int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};

int bit(int x, int i) {
    return (x >> i) & 1;
}

int sol(vector<int> a, int n, int m) {
    vector<vector<bool>> used(n, vector<bool>(m, 0));
    /*
    for (int i = 0; i < n; i++) {
        cout << bit(a[i], 0) << bit(a[i], 1) << endl;
    }
    */
    int res = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (bit(a[i], j) == 0) continue;
            if (used[i][j]) continue;
            queue<pair<int, int>> q;
            q.push({i, j});
            used[i][j] = 1;
            vector<pair<int, int>> cur{{i, j}};
            while (!q.empty()) {
                auto [x, y] = q.front();
                q.pop();
                for (int t = 0; t < 4; t++) {
                    int nx = x + dx[t];
                    int ny = y + dy[t];
                    if (nx < 0 || n <= nx) continue;
                    if (ny < 0 || m <= ny) continue;
                    if (bit(a[nx], ny) == 0) continue;
                    if (used[nx][ny]) continue;
                    used[nx][ny] = 1;
                    cur.push_back({nx, ny});
                    q.push({nx, ny});
                }
            }
            int u = i;
            int d = i;
            int l = j;
            int r = j;
            for (auto [x, y] : cur) {
                u = min(u, x);
                d = max(d, x);
                l = min(l, y);
                r = max(r, y);
            }
            //out(cur, u, d, l, r);
            vector<int> b(d - u + 1, 0);
            for (auto [x, y] : cur) {
                b[x - u] |= 1 << y;
            }
            bool is_submask = 0;
            for (int sx = -n; sx <= n; sx++) {
                if (u + sx < 0 || n <= d + sx) continue;
                for (int sy = -m; sy <= m; sy++) {
                    if (l + sy < 0 || m <= r + sy) continue;
                    if (sx == 0 && sy == 0) continue;
                    bool overlap = 1;
                    for (int x = 0; x < b.size(); x++) {
                        int cur = b[x];
                        if (sy < 0) {
                            cur >>= abs(sy);
                        }
                        if (sy > 0) {
                            cur <<= sy;
                        }
                        if ((cur & a[x + u + sx]) != cur) {
                            overlap = 0;
                            break;
                        }
                    }
                    if (overlap) {
                        is_submask = 1;
                        break;
                    }
                }
                if (is_submask) break;
            }
            if (!is_submask) {
                res += cur.size();
            }
        }
    }
    return res;
}

void Solve() {
    int T;
    cin >> T;
    while (T--) {
        int n, m;
        cin >> n >> m;
        vector<int> a;
        if (m <= n) {
            a.assign(n, 0);
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    char c;
                    cin >> c;
                    if (c == '.') {
                        a[i] |= 1 << j;
                    }
                }
            }
        }
        else {
            a.assign(m, 0);
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    char c;
                    cin >> c;
                    if (c == '.') {
                        a[j] |= 1 << i;
                    }
                }
            }
        }
        int ans = sol(a, max(n, m), min(n, m));
        cout << ans << "\n";
    }
}