Pseudominion (Small)

You are playing a card game. Every card carries three bonus numbers: a card bonus $c$, a score bonus $s$, and a turn bonus $t$. Some cards start in your hand and the rest sit in a deck on the table. You start with 1 turn left and a score of 0.

On a turn you may pick any card from your hand and play it. If the card has bonus numbers $c$, $s$, $t$, the following happens in order.

• The card is discarded from your hand and can never be used again.
• You draw the top $c$ cards of the deck into your hand. If the deck holds fewer than $c$ cards, you draw all of them.
• Your score increases by $s$.
• Your number of remaining turns increases by $t$.

Playing a card first spends 1 turn and then adds $t$ turns. If your hand is empty at the start of a turn, nothing happens on that turn. Once no turns remain, you cannot play another card. Report the largest score you can reach before running out of turns.

The walkthrough below shows how the rules interact. It uses a $c$ value larger than the limits allow.

The table below traces a score of 8 from these cards. The first three columns give your hand, your remaining turns, and your score just before each play, and the last column gives the card you play on that turn.

Card bonuses and turn bonuses let you chain a long run of cards together before you have to stop.

The first line of the input gives the number of test cases, $T$. $T$ test cases follow.

Each test case begins with a line containing $N$, the number of cards in your hand. The next $N$ lines each contain three integers $c$, $s$, and $t$, the bonus numbers of one card in your hand.

The next line contains $M$, the number of cards in the deck. The next $M$ lines each contain three integers $c$, $s$, and $t$, the bonus numbers of one card in the deck. The deck cards are listed in the order you draw them.

Limits

• $1 \le T \le 100$
• $1 \le N$
• $0 \le M$
• $N + M \le 80$
• $0 \le c \le 1$
• $0 \le s \le 20$
• $0 \le t \le 20$

For each test case, output one line containing Case #x: S, where $x$ is the test case number starting from 1 and $S$ is the largest score you can obtain before running out of turns.