#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int t,n,m,cnt,sz;
vector<vector<char>> a;
vector<vector<int>> vis;
map<int,int> mp;
int dx[] = {-1, 1, 0, 0}, dy[] = {0, 0, -1, 1};
void dfs(int x,int y){
vis[x][y] = cnt;
sz++;
for(int i=0;i<4;i++){
int nx=x+dx[i], ny=y+dy[i];
if(nx<1 || nx>n || ny<1 || ny>m ) continue;
if(a[nx][ny]=='.' || vis[nx][ny]) continue;
dfs(nx,ny);
}
}
int main(){
cin>>t;
while(t--){
cin >> n >> m;
a.assign(n+1,vector<char>(m+1));
vis.assign(n+1,vector<int>(m+1,0));
mp.clear();
cnt = 0;
}
