import java.util.Scanner;

public class Main{
	public static void main(String[]args) {
		try(Scanner scan = new Scanner(System.in)){
			
			int N = scan.nextInt();
			int M = scan.nextInt();
			
			int[]p =new int[M];
			String[]S = new String[M];
			for(int i = 0;i<M;i++) {
				p[i] = scan.nextInt();
				S[i] = scan.next();
			}
			
			long seitou = 0;
			long pena = 0;
			String[]res = new String[N];
			int[]pe = new int[N];
			
			for(int i = 0;i<M;i++) {
				if(res[p[i]-1]==null) {//まだ一回も回答されてない
					if(S[i].equals("WA")) {
						res[p[i]-1] = "WA";
						pe[p[i]-1]++;
					}else {
						res[p[i]-1] = "AC";
						seitou++;
					}
				}else{//一回回答した問題。ACなら無視
					if(res[p[i]-1].equals("WA")) {
						if(S[i].equals("WA")) {
							pe[p[i]-1]++;
						}else{
							res[p[i]-1] = "AC";
							pena+=pe[p[i]-1];
							seitou++;
						}
					}
				}
			}
			
			System.out.println(seitou);
			System.out.println(pena);
			
			
			
			
			
		}
	}
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz