import java.util.BitSet;
import java.util.Scanner;

class Solver {
	static final Solver INSTANCE = new Solver();

	void solve(Scanner sc) {
		int N = sc.nextInt();
		int M = sc.nextInt();
		int[] penalties = new int[N];
		BitSet set = new BitSet(N);
		for (int i = 0; i < M; i++) {
			int p = sc.nextInt() - 1;
			boolean s = sc.next().equals("AC");
			if (s) {
				set.set(p);
			}
			if (!set.get(p)) {
				penalties[p]++;
			}
		}

		int sum = 0;
		for (int i = set.nextSetBit(0); i >= 0; i = set.nextSetBit(i + 1)) {
			sum += penalties[i];
		}
		System.out.println(set.cardinality());
		System.out.println(sum);
	}
}

class Main {
	public static void main(String... args) {
		Scanner in = new Scanner(System.in);

		Solver.INSTANCE.solve(in);

		in.close();
	}
}
/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