import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

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

    // 問題数
    int a = sc.nextInt();
    // 提出数
    int b = sc.nextInt();

    int[] w = new int[a];
    Map<Integer, Boolean> map = new HashMap<>();
    for (int i = 0; i < a; i++) {
      map.put(i + 1, false);
      w[i] = 0;
    }

    int wrong = 0;
    int correct = 0;
    int problemNum;
    String result;
    for (int i = 1; i <= b; i++) {
      problemNum = sc.nextInt();
      result = sc.next();
      if (!map.get(problemNum)) {
        if (result.equals("WA")) {
          w[problemNum - 1]++;
        }
        if (result.equals("AC")) {
          correct++;
          wrong += w[problemNum - 1];
          map.put(problemNum, true);
        }
      }
    }
    System.out.println(correct + " " + wrong);
  }
}

/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