/*#include <bits/stdc++.h>
using namespace std;
#define MAX 2147483647
vector<pair<int, int> > arr[10001];
int n, m, dist[10001];
void dijkstra()
{
priority_queue<pair<int, int> >pq;
pq.push({0, 1});
while(!pq.empty())
{
int next=pq.top().second, nextdist=-pq.top().first;
pq.pop();
for(int i=0;i<arr[next].size();i++)
{
int ha=arr[next][i].first, haha=arr[next][i].second;
if(dist[ha]>nextdist+haha)
{
dist[ha]=nextdist+haha;
pq.push({-dist[ha], ha});
}
}
}
}
int main()
{
scanf("%d %d", &n, &m);
int a, b, c;
for(int i=1;i<=n;i++)dist[i]=MAX;
for(int i=1;i<=m;i++)
{
scanf("%d %d %d", &a, &b, &c);
arr[a].push_back({b, c});
arr[b].push_back({a, c});
}
dijkstra();
if(dist[n]==MAX)
{
printf("Impossible");
return 0;
}
printf("%d", dist[n]);
}*/
/*#include <bits/stdc++.h>
using namespace std;
int n, arr[11][11], ans=987654321, visited[11], cnt;
void backtracking(int current)
{
if(current==n+1)
{
ans=min(ans, cnt);
return ;
}
for(int i=1;i<=n;i++)
{
if(!visited[i])
{
visited[i]=1;
cnt+=arr[current][i];
backtracking(current+1);
visited[i]=0;
cnt-=arr[current][i];
}
}
}
int main()
{
scanf("%d", &n);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)scanf("%d", &arr[i][j]);
}
backtracking(1);
printf("%d", ans);
}*/
/*
#include <bits/stdc++.h>
using namespace std;
int n, k, visited[501], link[501];
vector<int> arr[501];
bool dfs(int node)
{
if(visited[node])return false;
visited[node]=1;
for(int i=0;i<arr[node].size();i++)
{
int next=arr[node][i];
if(link[next]==0)
{
link[next]=node;
return true;
}
if(dfs(link[next]))
{
link[next]=node;
return true;
}
}
return false;
}
int main()
{
scanf("%d %d", &n, &k);
int a, b;
for(int i=1;i<=k;i++)
{
scanf("%d %d", &a, &b);
arr[a].push_back(b);
}
int ans=0;
for(int i=1;i<=n;i++)
{
memset(visited, 0, sizeof(visited));
if(dfs(i))ans++;
}
printf("%d", ans);
}
*/
#include <bits/stdc++.h>
using namespace std;
int n, m;
string s[81];
int main()
{
int t;
scanf("%d", &t);
while(t--)
{
scanf("%d %d", &n, &m);
for(int i=1;i<=n;i++)cin >> s[i];
}
}