import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;

public class Main {

	public static void main(String[] args) {
		execute10_1();
	}

	private static void execute10_2() {

	}

	private static void execute10_1() {
		try (Scanner sc = new Scanner(System.in)) {
			int n = sc.nextInt();
			int m = sc.nextInt();
			int[] sub = new int[n];
			boolean[] comp = new boolean[n];

			int c = 0;
			int w = 0;

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

				if(comp[p]) continue;
				if ("AC".equals(s)) {
					comp[p]=true;
					c++;
					w+=sub[p];
				} else {
					sub[p]++;
				}
			}

			System.out.println(c + " " + w);

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