|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||64 MB||25||24||23||100.000%|
Young Mirko is a smart, but mischievous boy who often wanders around parks looking for new ideas. This time he’s come across pensioners playing the card game Belote. They’ve 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 Symbol||Card scoring value|
|If dominant suit||If ot dominant suit|
Write a programme that will determine and output the total number of points won in the game.
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 Ki (the first character being the label of the ith card (A, K, Q, J, T, 9, 8, 7), the second character being the suit of the ith card (S, H, D, C)).
The first and only line of output must contain the number of points from the task.
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
Clarification of the second example: The total number of points is equal to 11 + 4 + 3 + 20 + 10 + 14 + 0 + 0 + 11 + 4 + 3 + 2 + 10 + 0 + 0 + 0 = 92 points.