import java.util.Scanner;

public class Main {
	public static void main(String[] args){
		try(Scanner sc = new Scanner(System.in)) {

			int n = sc.nextInt();
			int m = sc.nextInt();

			int[] wrongCounts = new int[n];
			boolean[] corrects = new boolean[n];
			int totalAC = 0;

			for( int i = 0 ; i < m ; i++ ) {
				int index = sc.nextInt() - 1;
				String ans = sc.next();

				if ( corrects[index]) {
					// no count
				}
				else if ( ans.equals("WA")) {
					wrongCounts[index]++;
				}
				else if ( ans.equals("AC")) {
					corrects[index] = true;
					totalAC++;
				}
			}

			//calc total Wrong count
			//				int totalWrong = Arrays.stream(wrongCounts).sum();
			int totalWrong = 0;
			for(int i = 0 ; i < n ; i++ ) {
				if ( corrects[i]) {
					totalWrong += wrongCounts[i];
				}
			}

			System.out.println(String.format("%d %d", totalAC, totalWrong));

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