#include <bits/stdc++.h>

using namespace std;

typedef struct CASE{
	string tid;
	char pid;
	string result;
};

const int MAX = 10001;
int t,n;
CASE cs[MAX];
int zm[26];

char maxzm(int zm[26]){
	int max = 0;
	int size = 0;
	for(int i = 0;i < 26;i++){
		if(max < zm[i]){
			max = zm[i];
			size = i;	
		}
		cout << zm[i] << " ";
	}
	cout << endl;
	size += 65;
	return (char)size;
}

int main(){
	cin >> t;
	for(int i = 0;i < t;i++){
		cin >> n;
		for(int j = 0;j < n;j++){
			cin >> cs[j].tid >> cs[j].pid >> cs[j].result;
			if(cs[j].result == "rejected"){
				j--;
				n--;
				continue;
			}	
			int size = cs[j].pid - 65;
			int flag = 0;
			if(cs[j].result == "accepted"){
				for(int k = 0;k < j;k++){
					if(cs[j].tid == cs[k].tid && cs[j].pid == cs[k].pid && cs[j].result == cs[k].result){
						flag = 1;
						break;	
					}	
				}
				if(flag == 1){
					j--;
					n--;
					continue;
				}else{
					zm[size]++;
				}
				
			}	
		}
		cout << maxzm(zm) << endl;
		for(int i = 0;i < 26;i++){
			zm[i] = 0;
		}
	}
	return 0;
}