Problem:
Score : 300 points

Problem Statement

Takahashi participated in a contest on AtCoder.

The contest had N problems.

Takahashi made M submissions during the contest.

The i-th submission was made for the p_i-th problem and received the verdict S_i (AC or WA).

The number of Takahashi's correct answers is the number of problems on which he received an AC once or more.

The number of Takahashi's penalties is the sum of the following count for the problems on which he received an AC once or more: the number of WAs received before receiving an AC for the first time on that problem.

Find the numbers of Takahashi's correct answers and penalties.

Constraints

N, M, and p_i are integers.

1 \leq N \leq 10^5

0 \leq M \leq 10^5

1 \leq p_i \leq N

S_i is AC or WA.

Input

Input is given from Standard Input in the following format:

N M
p_1 S_1
:
p_M S_M

Output

Print the number of Takahashi's correct answers and the number of Takahashi's penalties.

Sample Input 1

2 5
1 WA
1 AC
2 WA
2 AC
2 WA

Sample Output 1

2 2

In his second submission, he received an AC on the first problem for the first time. Before this, he received one WA on this problem.

In his fourth submission, he received an AC on the second problem for the first time. Before this, he received one WA on this problem.

Thus, he has two correct answers and two penalties.

Sample Input 2

100000 3
7777 AC
7777 AC
7777 AC

Sample Output 2

1 0

Note that it is pointless to get an AC more than once on the same problem.

Sample Input 3

6 0

Sample Output 3

0 0

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<limits.h>
#include<math.h>

typedef struct{
    int p;
    char s[3];
}kekka;

int p_comp(const void*a,const void*b){return ((kekka*)a)->p-((kekka*)b)->p;}

int int_comp(const void*a,const void*b){return *(int*)a-*(int*)b;}
int frag[100];
int num[100];
void fx(int n,int k)
{
    int f,i,j;
    for(i=0;i<n;i++){
        f=frag[i];
        if(f==0){
            frag[i]=1;
            num[n-k]=i+1;
            if(k==1){
                //num[]に数字が入ってる
            }
            else{
                fx(n,k-1);
            }
            frag[i]=0;
        }
    }
}

int main()
{
    int n,m;
    kekka list[100000];
    int frag[100000];

    scanf("%d %d",&n,&m);
    for(int i=0;i<m;i++){
        scanf("%d %s",&list[i].p,list[i].s);
    }
    for(int i=0;i<100000;i++){
        frag[i]=0;
    }
    qsort(list,m,sizeof(kekka),p_comp);
    int accnt=0;
    int wacnt=0;

    for(int i=0;i<m;i++){
        if(!strcmp(list[i].s,"AC")){
            if(frag[list[i].p-1]==0){
                accnt++;
                frag[list[i].p-1]=1;
            }
        }
        else if(!strcmp(list[i].s,"WA")){
            if(frag[list[i].p-1]==0){
                wacnt++;
            }
        }
    }
    printf("%d %d\n",accnt,wacnt);


    return 0;
}