import java.util.Scanner;
import java.util.TreeMap;

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 = 0;
		int[] wa = new int[n];
		int wawa = 0;

		TreeMap<Integer, String> ans = new TreeMap<>();

		for (int i = 0; i < m; i++) {
			int p = sc.nextInt();
			String s = sc.next();
			if (ans.containsKey(p)) {
				if (ans.get(p).equals("AC")) {
					continue;
				} else {
					ans.put(p, s);
					if (s.equals("AC")) {
						ac++;
						continue;
					} else if(s.equals("WA")){
						wa[p-1]++;
						continue;
					}
				}
			} 
			ans.put(p, s);
				if (s.equals("AC")) {
					ac++;
				} else if(s.equals("WA")){
					wa[p-1]++;
				}
			}
		
		System.out.println(ac);
		for(Integer key : ans.keySet()) {
			if(ans.get(key).equals("AC")) {
				wawa = wawa + wa[key-1];
			}
		}
		
		System.out.println(wawa);
		

		}
}
/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