import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();

		//解いたことがあるかカウンター
		int[] ac = new int[N];
		//ACしたならばWAを数えてもよい退避場所
		int[] wa = new int[N];

		//答えカウンター
		int ok = 0;
		int ng = 0;

		for (int i = 0; i < M; i++) {
			//問題番号は配列のキーにあたる
			int indx = sc.nextInt();
			String acWa = sc.next();

			if (acWa.equals("AC")) {
				if (ac[indx - 1] == 1) {

				} else {
					ok++;
					ac[indx - 1] = 1;
				}
			} else {
				if (ac[indx - 1] == 1) {

				} else {
					wa[indx - 1]++;
				}
			}
		}
		//ACしたならばWAを数えてもよい
		for (int i = 0; i < N; i++) {
			if (ac[i] == 1) {
				ng = ng + wa[i];
			} else {
			}
		}

		System.out.println(ok + " " + ng);
	}
}

/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