#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>

int compare( const void* elem1, const void* elem2 ){
 char*s1,*s2;
 int count1,count2;
 s1=(char*)elem1;
 s2=(char*)elem2;
 s1=strstr(s1," ");
 s2=strstr(s2," ");

 	sscanf(s1," %d",&count1);
	sscanf(s2," %d",&count2);
	if(count1>count2) return -1;
	if(count1<count2) return 1;

	s1=(char*)elem1;
	s2=(char*)elem2;

 return strcmp((const char*)s1,(const char*)s2);
}

void oneset(){
int Es=0,Bs=0,Fs=0,Ms=0,Cs=0,Os=0;
int height,width,i,j;
char s[1024],ch,results[6][1024];
scanf("%d %d\n",&height,&width);
 for(j=0;j<height;j++){
  for(i=0;i<width;i++){
    ch=getc(stdin);
	switch(ch){
	case 'E':Es++;break;
	case 'B':Bs++;break;
	case 'F':Fs++;break;
	case 'M':Ms++;break;
	case 'C':Cs++;break;
	case 'O':Os++;break;
	}
  }
  gets(s);
 }
 sprintf(results[0],"Elm: %d",Es);
 sprintf(results[1],"Birch: %d",Bs);
 sprintf(results[2],"Fir: %d",Fs);
 sprintf(results[3],"Maple: %d",Ms);
 sprintf(results[4],"Chestnut: %d",Cs);
 sprintf(results[5],"Oak: %d",Os);
 qsort(results,6,1024,compare);
 for(i=0;i<6;i++)
	 printf("%s\n",results[i]);
}

main(){
	int iters,i;
	scanf("%d\n",&iters);
	for(i=0;i<iters;i++){
		printf("Data set %d:\n",i+1);
		oneset();
		printf("\n");
	}
}