#include <bits/stdc++.h>

using namespace std;
using i64 = int;
const int maxn=1e3+2;
i64 dx[4]={0,1,-1,0},dy[4]={1,0,0,-1};
int a[maxn][maxn];
int l,r,up,down,n,m;
map<int,int> mp;
struct node{
    i64 x,y,d_u,r_l;
    string s;
}liantong[maxn];
char c1[4]={'D','R','L','U'};
int v[maxn][maxn],cnt;
void dfs(int x,int y)
{
    l=min(l,y);
    r=max(r,y);
    up=min(up,x);
    down=max(down,x);
    for(int i=0;i<4;++i)
    {
        int xx=x+dx[i];
        int yy=y+dy[i];
        if(xx<=0||yy<=0||xx>n||yy>m||a[xx][yy]||v[xx][yy]) continue;
        liantong[cnt].s+=c1[i];
        v[xx][yy]=1;
        dfs(xx,yy);
    }
}
bool check(int x,int y)
{
    int xx=liantong[x].x;
    int yy=liantong[x].y;
    for(int i=0;i<liantong[y].s.length();++i)
    {
        int xxx=xx+dx[mp[liantong[y].s[i]]];
        int yyy=yy+dy[mp[liantong[y].s[i]]];
        if(xxx<=0||yyy<=0||xxx>n||yyy>m||a[xxx][yyy]) 
        {
            return false;
        }
        xx=xxx;
        yy=yyy;
    }
    return true;
}
void solve()
{
    memset(a,0,sizeof(a));
    memset(v,0,sizeof(v));
    cnt=0;
    cin>>n>>m;
    for(int i=1;i<=n;++i)
    {
        for(int j=1;j<=m;++j)
        {
            char c;
            cin>>c;
            if(c=='O')
            a[i][j]=1;
        }
    }
    for(int i=1;i<=n;++i)
    for(int j=1;j<=m;++j)
    {
        if(!v[i][j]&&!a[i][j])
        {
            v[i][j]=1;
            cnt++;
            l=j;
            r=j;
            up=i;
            down=i;
            liantong[cnt].s="";
            dfs(i,j);
            liantong[cnt].x=i;
            liantong[cnt].y=j;
            liantong[cnt].r_l=r-l+1;
            liantong[cnt].d_u=down-up+1;
            
        }
    }
    long long ans=0;
    for(int i=1;i<=cnt;++i)
    {
        int flag=0;
    for(int j=1;j<=cnt;++j)
    {
        if(i==j) continue;
        if(liantong[i].r_l>liantong[j].r_l||liantong[i].d_u>liantong[j].d_u) 
        {
            continue;
        }if(!check(j,i)) 
        {
    
            continue;
        }
        flag=1;
        break;
    }
    if(!flag)
    { ans+=liantong[i].s.length()+1;
    }
    }
    cout<<ans<<'\n';
}
int main()
{
    int T;
    mp['D']=0;
    mp['R']=1;
    mp['L']=2;
    mp['U']=3;
    cin>>T;
    while(T--)
    {
        solve();
    }
}