#include <cstdio>
#include <algorithm>
#include <queue>
#include <bitset>

using namespace std;

const int max1 = 1e3;

int T, n, m, sum, ans;
char Map[max1 + 5][max1 + 5];

queue < pair <int, int> > que;
bool vis[max1 + 5][max1 + 5];

bitset <1024> bit[max1 * 8 + 5];

int Get_Id1 ( int x, int y )
{
    return (x + n) * (m + m + 1) + (y + m + 1);
}

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

void Bfs1 ( int x, int y )
{
    for ( int i = 1; i <= n; i ++ )
        for ( int j = 1; j <= m; j ++ )
            vis[i][j] = false;

    vis[x][y] = true;
    que.push(make_pair(x, y));
    while ( !que.empty() )
    {
        pair <int, int> now = que.front();
        que.pop();

        --now.first;
        if ( now.first >= 1 && Map[now.first][now.second] == '.' && !vis[now.first][now.second] )
            que.push(now), vis[now.first][now.second] = true;
        
        if ( now.first < 1 || Map[now.first][now.second] == 'O' )
            bit[Get_Id1(now.first - x, now.second - y)].set(Get_Id2(x, y));

        ++now.first;

        ++now.first;
        if ( now.first <= n && Map[now.first][now.second] == '.' && !vis[now.first][now.second] )
            que.push(now), vis[now.first][now.second] = true;
        
        if ( now.first > n || Map[now.first][now.second] == 'O' )
            bit[Get_Id1(now.first - x, now.second - y)].set(Get_Id2(x, y));

        --now.first;

        --now.second;
        if ( now.second >= 1 && Map[now.first][now.second] == '.' && !vis[now.first][now.second] )
            que.push(now), vis[now.first][now.second] = true;
        
        if ( now.second < 1 || Map[now.first][now.second] == 'O' )
            bit[Get_Id1(now.first - x, now.second - y)].set(Get_Id2(x, y));

        ++now.second;

        ++now.second;
        if ( now.second <= m && Map[now.first][now.second] == '.' && !vis[now.first][now.second] )
            que.push(now), vis[now.first][now.second] = true;
        
        if ( now.second > m || Map[now.first][now.second] == 'O' )
            bit[Get_Id1(now.first - x, now.second - y)].set(Get_Id2(x, y));

        --now.second;
    }
    return;
}

void Bfs2 ( int x, int y )
{
    bitset <1024> tmp;

    for ( int i = 1; i <= n; i ++ )
        for ( int j = 1; j <= m; j ++ )
            vis[i][j] = false;

    vis[x][y] = true;
    que.push(make_pair(x, y));
    while ( !que.empty() )
    {
        pair <int, int> now = que.front();
        que.pop();

        tmp |= bit[Get_Id1(now.first - x, now.second - y)];

        --now.first;
        if ( now.first >= 1 && Map[now.first][now.second] == '.' && !vis[now.first][now.second] )
            que.push(now), vis[now.first][now.second] = true;
        ++now.first;

        ++now.first;
        if ( now.first <= n && Map[now.first][now.second] == '.' && !vis[now.first][now.second] )
            que.push(now), vis[now.first][now.second] = true;
        --now.first;

        --now.second;
        if ( now.second >= 1 && Map[now.first][now.second] == '.' && !vis[now.first][now.second] )
            que.push(now), vis[now.first][now.second] = true;
        ++now.second;

        ++now.second;
        if ( now.second <= m && Map[now.first][now.second] == '.' && !vis[now.first][now.second] )
            que.push(now), vis[now.first][now.second] = true;
        --now.second;
    }

    ans += tmp.count() == sum - 1;
    // printf("x = %d y = %d ans = %d\n", x, y, ans);

    return;
}

void Work ()
{
    scanf("%d%d", &n, &m);
    for ( int i = 1; i <= n; i ++ )
        scanf("%s", Map[i] + 1);
    
    for ( int i = 1; i <= (n + n + 1) * (m + m + 1); i ++ )
        bit[i].reset();

    sum = ans = 0;
    for ( int i = 1; i <= n; i ++ )
        for ( int j = 1; j <= m; j ++ )
            if ( Map[i][j] == '.' )
                Bfs1(i, j), ++sum;
    
    for ( int i = 1; i <= n; i ++ )
        for ( int j = 1; j <= m; j ++ )
            if ( Map[i][j] == '.' )
                Bfs2(i, j);

    printf("%d\n", ans);
    return;
}

int main ()
{
    scanf("%d", &T);
    while ( T -- )
        Work();

    return 0;
}