RUMMY - Help Vishnu with his points

no tags 

Vishnu is very fond of Rummy. Rummy is a game played with standard set of cards. Each deck has 52 cards, 4 suits with 13 ranks each. In Rummy, however, multiple decks can be used in a single game. In our problem we ignore card suits and are only looking at ranks. Those are as follows (from lowest to highest): A, 2, 3, ..., 10, J, Q, K, (A). Ace is a special card that can be treated both as lowest (before 2) and highest rank (after K).

Rummy has different variants, our is as follows. Each player has a hand of exactly 13 cards. Cards are being discarded from a hand by constructing sets. Each card can belong to at most one set. There are two types of valid sets:
(1) Exactly three cards of the same rank, for example (2, 2, 2) or (Q, Q, Q).
(2) Sequence of at least three cards.

Sequence is a set of consecutive ranked cards, with at most one card for each rank. Some examples: (2, 3, 4, 5), (Q, K, A), (A, 2, 3), (9, 10, J, Q). Note that set (K, A, 2) would not be a valid sequence, since a given Ace card can only have one of the two ranks, not both.

In addition one of the ranks is chosen to be treated as Jokers, denoted as JK. When constructing sequences, jokers can be used to substitute any rank. For example: (2, JK, 4), (J, Q, JK, A). There can be more than one joker in a single hand. Each of them can be treated as a different rank to be used in a single sequence. Examples: (7, JK, 9, JK, J), (JK, 4, JK, JK, 7). Jokers don't alter the way type (1) sets are build. For example (5, 5, JK) is invalid, but (JK, JK, JK) still can be formed.

Each card has a number of points assigned to it. Ranks 2 to 10 have points equal to their number. A, J, Q, K are 10 points each and Jokers are 0 points. Number of points on a hand is a sum of this hands cards points. The goal of the game is to have minimum number of points after removing some number of sets (possibly none). Help Vishnu find the optimal score for a given hand.

Input

Single integer T (1 <= T <= 20) on the first line, the number of test cases. The next T lines contain 14 numbers each, all positive integers not bigger than 13. First 13 describe cards in Vishnu hand and the 14th is the rank chosen to be Jokers. Integers 1, 11, 12, 13 denote A, J, Q, K respectively. There is no upper or lower limit on the number of cards with the same rank, including Jokers. Cards can be freely rearranged to form sets.

Output

For each test case output single integer in a separate line: minimum number of points Vishnu can get with a given hand.

Example

Input:
2
1 2 3 4 5 6 7 8 9 10 11 12 13 3
1 1 3 3 5 5 7 7 9 11 11 13 13 9

Output:
0
60

hide comments
Mostafa 36a2: 2014-02-06 21:56:08

I think there was an important comment which removed by the last bug ,
the test case
1 1 1 1 1 1 1 1 1 1 1 1 1 1
has the output 0 , as they all jockers

:D: 2013-12-01 12:45:17

Problem description corrected. If you were having problems, you can try rereading now.

Last edit: 2013-12-01 17:11:14
Aswin Murugesh: 2013-10-22 21:48:21

@Simes: 9 is the joker. So, 11,9,13,1 make a set. Add all others to get 60 :)

Simes: 2013-10-22 18:24:52

How does the second example result in 60 points? There are no sets or runs to be made, so all cards (except joker) contribute to the points. AJK each count 10, so that makes 10+10+3+3+5+5+7+7+9+10+10+10+10 = 99.

Where does 60 come from?


Added by:Aswin Murugesh
Date:2013-10-11
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own Problem