CF120G.Boom

The first line contains two integers $n,t$ $(1<=n,t<=100)$ , which correspondingly denote the number of teams and a turn's duration.

Next $n$ lines of the input file contain four integers each: $a_{i1},b_{i1},a_{i2},b_{i2}$ $(1<=a_{ij},b_{ij}<=100)$ — the skills of the first and the second player of the $i$ -th team. The teams are given in the order in which they play.

The next line of the input file contains integer $m$ $(1<=m<=100)$ the number of cards.

Next $2m$ lines contain the cards' descriptions. Two lines describe each card. The first line of the description contains the word that consists of no more than 20 characters. The words only contain small Latin letters. The second line of the description contains an integer $c_{k}$ ( $1<=c_{k}<=100$ ) — the complexity of the word written on the $k$ -th card. The cards are listed in the order in which the lie in the deck from top to bottom. The words on all cards are different.

Print $n$ lines. On the $i$ -th line first print number $s_{i}$ the number of points the $i$ -th team wins. Then print $s_{i}$ space-separated words — the words from the cards guessed by team $i$ in the order in which they were guessed.

无