#include<bits/stdc++.h> using namespace std; int t; char c[20][20]; int tmp; struct point { int mx; int my; int cx; int cy; int num; }; void bfs(int mx,int my,int cx,int cy) { queue<point> q; } int cx; int cy; int mx; int my; int main() { cin>>t; while(t--) { for(int i=1;i<=10;i++) { for(int j=1;j<=10;j++) { cin>>c[i][j]; if(c[i][j]=='C') { cx=i; cy=j; } if(c[i][j]=='M') { mx=i; my=j; } } } tmp=bfs(mx,my,cx,cy); } return 0; }