import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int m = in.nextInt();
		HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
		int correct = 0;
		int penalty = 0;
		for(int i=0; i<m; i++) {
			int p = in.nextInt();
			String s = in.nextLine().trim();
			//System.out.println(s);
			if(map.containsKey(p)) {
				if(map.get(p)==-1) continue;
				if(s.equals("AC")) {
					correct += 1;
					penalty += map.get(p);
					map.put(p, -1);
					//System.out.println(correct + " A " + penalty);
				}else {
					map.put(p, map.get(p)+1);
					//System.out.println(correct + " B " + penalty);
				}
			}else{
				if(s.equals("AC")) {
					correct += 1;
					map.put(p, -1);
					//System.out.println(correct + " C " + penalty);
				}else {
					map.put(p, 1);
					//System.out.println(correct + " D " + penalty);
				}
			}
		}
		System.out.println(correct + " " + penalty);
	}
}

/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