Bus Riding

A city has $n$ bus stops, and $k$ circular bus routes pass through them. Each route is given as a list of the numbers of the stops it passes through, and the $i$-th route passes through stops $a_{i,1}, a_{i,2}, \ldots, a_{i,l_i}$ in that order. Exactly one bus runs on each route. At time 0 this bus is at stop $a_{i,1}$. The bus takes exactly one minute to reach the next stop on its route. The time the bus spends standing at a stop can be ignored. All routes are circular, meaning that one minute after leaving stop $a_{i,l_i}$ the bus arrives at stop $a_{i,1}$ and travels the route again.

Several people in this city decided to ride the buses. Each of them made a plan for their ride. The plan of the $j$-th person consists of the stop $b_j$ where the person starts riding and a sequence of numbers $c_{j,1}, c_{j,2}, \ldots, c_{j,m_j}$. These numbers mean the following: at time 0 the person comes to stop $b_j$ and waits for the nearest bus (if at that moment some bus is at stop $b_j$, the person boards it). On this bus they ride past $c_{j,1}$ stops, then get off and wait for the next bus at the stop where they ended up. On that bus they ride past $c_{j,2}$ stops, get off again, and wait for the next bus again. And so on. If at some moment several buses arrive at a stop at once, the person boards the bus with the smallest route number. When a person gets off a bus at some stop, they can leave that stop no earlier than one minute later.

For each person, determine how many minutes after the starting moment their ride ends and at which stop it ends.

The input file first contains the number $n$, then the number $k$. Then $k$ lines follow, specifying the bus routes. Each line begins with the number $l_i$, which gives the length of the route, followed by the list of stops the route passes through: $a_{i,1}, a_{i,2}, \ldots, a_{i,l_i}$. A route may pass through the same stop several times.

Then comes the number $p$, the number of people, followed by $p$ lines specifying the people's plans. Each line contains first the number $b_j$, the starting stop number, and $m_j$, the number of numbers in the sequence. Then come the numbers $c_{j,1}, c_{j,2}, \ldots, c_{j,m_j}$.

All numbers in the input file are positive integers not exceeding 50.

For each person, output two numbers to the output file: the time in minutes when their ride ends, and the number of the stop where this happens. If the person cannot complete their plan (at some stop they will not wait for a bus), output two zeros for them.