import java.io.InputStream;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
	InputStream in = System.in;
	PrintStream out = System.out;

	public void _main(String[] args) {
		Scanner sc = new Scanner(in);

		int N = sc.nextInt();
		int M = sc.nextInt();
		int[] p = new int[M];
		String[] S = new String[M];

		for (int i = 0; i < M; i++) {
			p[i] = sc.nextInt() - 1;
			S[i] = sc.next();
		}
		sc.close();

		boolean[] ac = new boolean[N];
		Arrays.fill(ac, false);

		boolean[] b = new boolean[N];
		for(int i=0;i<M;i++) {
			if(S[i].equals("AC")) {
				b[p[i]] = true;
			}
		}
		
		
		int numOfAC = 0;
		int numOfWA = 0;

		for (int i = 0; i < M; i++) {
			if (S[i].equals("AC")) {
				if (!ac[p[i]]) { //AC済みでないなら
					numOfAC++;
					ac[p[i]] = true;
				}
				//AC済みならすでにカウントされているので何もしない
				
			} else { // WA
				if (!ac[p[i]] && b[p[i]]) { //AC済みでないなら
					numOfWA++; //ペナルティを増やす
				}
				//AC済みならペナルティなし
			}
		}

		out.println(numOfAC + " " + numOfWA);

	}

	public static void main(String[] args) {
		new Main()._main(args);
	}
}

/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