11-5. 50971 - Belote Game

Belote Game

Young Mirko is a smart, but mischievous boy who often wanders around parks looking for new ideas. This time he has come across pensioners

playing the card game Belote.  They have invited him to help them determine the total number of points won in a single game.

Each card can be uniquely determined by its symbol and suit. A set of four cards is called a hand. In each game, one suit that "trumps" any other and is called the dominant suit.
The number of points in a single game is equal to the sum of scoring values of each card from each hand won in the game.
 Mirko has noticed that the pensioners have won N hands and that suit B was the dominant suit.

The scoring values of cards are given in the following table:

Card scoring value
Card symbol	If dominant suit	If not dominant suit
A	11	11
K	4	4
Q	3	3
J	20	2
T	10	10
9	14	0
8	0	0
7	0	0

 

 

 

 

 

.

 

Write a program that will determine and output the total number of points won in the game.

INPUT

The first line contains the number of hands N (1<=N<=100) and the value of suit B (S, H, D, C) from the task. Each of the following 4N lines contains

the description of card K_i (the first character being the label of the i^th card ( A, K, Q, J, T, 9, 8, 7 ), the second character being the suit of the i^th card ( S; H; D; C)).

 

OUTPUT

The first and only line of output must contain the number of points from the task.

 

Sample Input1:	Sample Input2:
2 S TH 9C KS QS JS TD AD JH	4 H AH KH QH JH TH 9H 8H 7H AS KS QS JS TS 9S 8S 7S
Sample Output1:	Sample Output2:
60	92