import java.io.*;
import java.util.*;
class probc{
	static int seen(int x, int y, char[][] grid){
		int ans=0;
		for (int a=0;a<grid.length;a++){
			for(int b=0;b<grid[a].length;b++){
				if (grid[a][b]!='-'){
					int dx=x-a;
					int dy=y-b;
					int g=gcf(dx,dy);
					dx/=g;
					dy/=g;
					boolean blocked=false;
					for (int c=a+dx,d=b+dy;c!=x || d!= y;c+=dx,d+=dy){
							if (grid[c][d]!='-'){
								blocked=true;
							}
					
					}
					if (!blocked){ans++;}
				}
			}
		}
		return ans;
	}
	static int gcf(int a, int b){
		if (a==0)return abs(b);
		a=abs(a);
		b=abs(b);
		for (int x=a;x>0;x--){
			if (a%x==0 && b%x==0){
				return x;
			}
		}
		return 1;
	}
	static int abs(int x){
		if (x<0) return -x;
		else return x;
	}
	public static void main(String[] args)throws IOException{
		BufferedReader in= new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer token;
		int n=Integer.parseInt(in.readLine());
		int h,w,index;
		String sub,line;
		char[][][] grid;
		grid =new char[n][][];
		for(int x=0;x<n;x++){
				line= in.readLine();
				token=new StringTokenizer(line);
				//sub= line.substring(0,index);
				h= Integer.parseInt(token.nextToken());
				//sub=line.substring(index+1);
				w=Integer.parseInt(token.nextToken());
				grid[x]=new char[h][w];
				for (int a=0;a<h;a++){
					line=in.readLine();
					for (int b=0; b<w; b++){
						grid[x][a][b]=line.charAt(b);
					}
				}
				int hi=0;
				for(int a=0;a<grid[x].length;a++){
					for(int b=0;b<grid[x][a].length;b++){
						if (grid[x][a][b]=='-'){
							int ans=seen(a,b,grid[x]);
							if (ans>hi){hi=ans;}
						}
					}
				}
				System.out.println("Data set "+(x+1)+": He can see " + hi +" trees in the following places");
				for(int a=0;a<grid[x].length;a++){
					for(int b=0;b<grid[x][a].length;b++){
						if (grid[x][a][b]=='-'){
							int ans=seen(a,b,grid[x]);
							if (ans==hi){
								System.out.println((a+1)+" "+(b+1));
							}
						}
					}
				}
				System.out.println("");

		
		}
		
		//in.readLine();
	}
}