xiaoA is a beautiful girl, and she has so many skirts that she won't wear a skirt a second time before the skirt is washed.Now xiaoA wants to go shopping,
how many skirts she can choose to wear.
In order to distinguish these skirts,she gives out every skirt with a unique name.
Input
The first line of input contains a positive integer T (T <= 100), the number of test cases.
Each test case contains two integers N and M (1<=N,M<=100) in the first line.
N is the number of skirts.M is the number of operations.
Then N lines follow.Every line contains a word and the word is not longer than 10.
Then M lines follow.Each line contains a character 'D' or 'W' and the name of a skirt.
'D' indicates that xiaoA has wore the skirt. 'W' indicates that xiaoA has washed the skirt.
Output
After the M operations, you need to output that how many skirts can be chosen by xiaoA to wear.
Sample Input
1
5 5
SkirtA
SkirtB
SkirtC
SkirtD
SkirtE
D SkirtA
D SkirtB
D SkirtC
D SkirtD
W SkirtA
Sample Output
2
how many skirts she can choose to wear.
In order to distinguish these skirts,she gives out every skirt with a unique name.
Input
The first line of input contains a positive integer T (T <= 100), the number of test cases.
Each test case contains two integers N and M (1<=N,M<=100) in the first line.
N is the number of skirts.M is the number of operations.
Then N lines follow.Every line contains a word and the word is not longer than 10.
Then M lines follow.Each line contains a character 'D' or 'W' and the name of a skirt.
'D' indicates that xiaoA has wore the skirt. 'W' indicates that xiaoA has washed the skirt.
Output
After the M operations, you need to output that how many skirts can be chosen by xiaoA to wear.
Sample Input
1
5 5
SkirtA
SkirtB
SkirtC
SkirtD
SkirtE
D SkirtA
D SkirtB
D SkirtC
D SkirtD
W SkirtA
Sample Output
2
