$N$ people, person $1$, person $2$, $\ldots$, person $N$, are playing roulette. The outcome of a spin is one of the $37$ integers from $0$ to $36$. For each $i = 1, 2, \ldots, N$, person $i$ has bet on $C_i$ of the $37$ possible outcomes: $A_{i, 1}, A_{i, 2}, \ldots, A_{i, C_i}$.
The wheel has been spun, and the outcome is $X$. Print the numbers of all people who have bet on $X$ with the fewest bets, in **ascending order**.
More formally, print all integers $i$ between $1$ and $N$, inclusive, that satisfy both of the following conditions, in **ascending order**:
* Person $i$ has bet on $X$.
* For each $j = 1, 2, \ldots, N$, if person $j$ has bet on $X$, then $C_i \leq C_j$.
Note that there may be no number to print (see Sample Input 2).
## Constraints
* $1 \leq N \leq 100$
* $1 \leq C_i \leq 37$
* $0 \leq A_{i, j} \leq 36$
* $A_{i, 1}, A_{i, 2}, \ldots, A_{i, C_i}$ are all different for each $i = 1, 2, \ldots, N$.
* $0 \leq X \leq 36$
* All input values are integers.
## Input
The input is given from Standard Input in the following format:
$N$
$C_1$
$A_{1, 1}$ $A_{1, 2}$ $\ldots$ $A_{1, C_1}$
$C_2$
$A_{2, 1}$ $A_{2, 2}$ $\ldots$ $A_{2, C_2}$
$\vdots$
$C_N$
$A_{N, 1}$ $A_{N, 2}$ $\ldots$ $A_{N, C_N}$
$X$
[samples]