#include "stdio.h"
#include "stdlib.h"
#include "string.h"
#include "math.h"
#include "iostream.h"

class plant {
public:
	int grid[100][100];
	int rownum,int colnum;
	int trees[7];
	
	plant() {
		rownum=0;
		colnum=0;
	}
 
	ini_plant(int i,int j) {
		rownum=i;
		colnum=j;
		for(int k=0;k<6;k++) 
			trees[k]=0;

	}

	void insert_row(char *ret,int k) {
		int i;
		for(i=0;i<colnum;i++) {
			grid[k][i]=ret[i];
			if(ret[i]=='B')
				trees[0]=trees[0]+1;
			else if(ret[i]=='C')
				trees[1]=trees[1]+1;
			else if(ret[i]=='E')
				trees[2]=trees[2]+1;
			else if(ret[i]=='F')
				trees[3]=trees[3]+1;
			else if(ret[i]=='M')
				trees[4]=trees[4]+1;
			if(ret[i]=='O')
				trees[5]=trees[5]+1;
		}
	}


	int large(int i1,int j1) {
		int k,m,n,i,j;
		i=abs(i1);
		j=abs(j1);
		if(i==0)
			return j;
		else if(j==0)
			return i;

		if(i>=j)
			k=j;
		else 
			k=i;
		for(m=k;m>=1;m--) {
			if((((i/m)*m)==i)&&(((j/m)*m)==j))
				return m;
		}
	}

		
	bool seeable(int row1,int col1,int row2,int col2) {
		int i,j,k,m,n,m1,n1;
		float k1,k2;

		if((row1==row2)&&(col1==col2))
			return false;
		k=large(row1-row2,col1-col2);
		if(k==1) 
			return true;
		m=(row2-row1)/k;
		n=(col2-col1)/k;
		for(i=1;i<k;i++) {
			m1=row1+m*i;
			n1=col1+n*i;
			if(grid[m1][n1]!='-') {
				return false;
			}
		}
		return true;
	}


	int trees_see(int row1,int col1) {
		int i,j,m,n,total=0;
		double k1,k2;

		if(grid[row1][col1]!='-')
			return -2;
		for(i=0;i<rownum;i++) {
			for(j=0;j<colnum;j++) {
				if((grid[i][j]!='-')&&seeable(row1,col1,i,j))
					total++;
			}
		}
		return total;
	}
						


};

void main() {
	int data_sets,h,w,i,j,m1,n1,m2,n2,t;
	int maxrow,maxcol,max,tt[100][100];
	char ret[100];
	plant myplant;


	cin>>data_sets;
	for(i=0;i<data_sets;i++) {
		cin>>h>>w;
		myplant.ini_plant(h,w);
		for(j=0;j<h;j++) {
			cin>>ret;
			myplant.insert_row(ret,j);
		}
		max=-1;
		for(m1=h-1;m1>=0;m1--) {
			for(m2=w-1;m2>=0;m2--) {
				tt[m1][m2]=myplant.trees_see(m1,m2);
				if(tt[m1][m2]>max) 
					max=tt[m1][m2];
			}
		}
		cout<<"Data set "<<i+1<<": He can see "<<max<<" trees in the following places"<<endl;
		for(m1=0;m1<h;m1++) {
			for(m2=0;m2<w;m2++) {
				if(max==tt[m1][m2]) 
					cout<<m1+1<<" "<<m2+1<<endl;
			}
		}
		cout<<endl;

	}

}