#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int N=50+2;
int n,m,T;
int L,R,pre[N*N];
bool vis[N*N];
vector<int>go[N*N];
char mp[N][N];
int line[N*N][2],row[N*N][2];
int ans;
void clear(){
    memset(vis,0,sizeof vis);
    memset(pre,0,sizeof pre);
    //warning !! vector.clear()
}
bool dfs(int x){
    
}
int main()
{
    scanf("%d",&t);
    for(int o=1;o<=t;o++){
        scanf("%d%d",&n,&m);
        clear();
        for(int i=1;i<=n;i++){
            scanf("%s",mp[i]+1);
        }
        for(int i=1;i<=n;i++){
            while()
        }//row
        for(int j=1;j<=m;j++){
            while()
        }//line
        for(int i=1;i<=L;i++){
            for(int j=1;j<=R;j++){
                
            }
        }//connect
        for(int i=1;i<=L;i++){
            memset(vis,0,sizeof vis);
            if(dfs(i)){
                ans++;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}