import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.List;
import java.util.Queue;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		execute3();
	}
	
	private static void execute3() {
		try (Scanner sc = new Scanner(System.in)) {
			int M = sc.nextInt();
			int N = sc.nextInt();
			
			int[] tryN = new int[M];
			boolean[] ac = new boolean[M];
			for(int j=0;j<M;j++) {
				tryN[j]=0;
				ac[j]=false;
			}
			
			for(int i=0;i<N;i++) {
				int p = sc.nextInt()-1;
				String r = sc.next();
				if(r.equals("AC")) {
					if(!ac[p]) {
						ac[p]=true;
					}
				} else {
					if(!ac[p]) {
						tryN[p]++;
					}
				}
				
			}
			
			int ansAc=0;
			int wa=0;
			for(int i=0;i<M;i++) {
				if(ac[i]) {
					ansAc++;
					wa+=tryN[i];
				}
			}
			System.out.println(ansAc+" "+wa);
		}
	}
}
/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