Problem Statement

We will run a simplified simulation of a conveyor belt sushi restaurant.
The seats in the restaurant are numbered from 1 to 20.
Once the restaurant opens, customers arrive and take seats. Each customer holds a list of foods they want to eat (there are even extreme customers, such as one whose list is 10 plates of horse mackerel). When a sushi topping on their list reaches them, they always take it, and one plate of it is removed from their list.
Sushi flows one piece at a time past seats 1 through 20, and is discarded if nobody takes it.
The data is given one line at a time in chronological order.
The types of data are as follows.

Data 0

A customer sits in seat i, and their list of foods they want to eat is given.

Data 1

One plate of sushi is sent down the conveyor belt and passes seats 1 through 20 in order.

Data 2

The customer in seat i goes to pay the bill.

Input

$N$
$U_1$
$\dots$
$U_n$

2 $\le$ $N$ $\le$ 5005, where N is the number of data entries.
Each Ui is given on one line and is one of the following 3 types of data.

Data 0

0 $n_i$ $m_i$ $A_{(i,1)}$ $\dots$ $A_{(i,mi)}$

A customer sits in seat $n_i$, and their list of foods they want to eat consists of $m_i$ items.
$A_(i,j)$ is the type of sushi topping they want to eat.

The input also satisfies the following constraints.
$ 1 \le n_i \le 20$
$ 1 \le m_i \le 10$
$ 1 \le |A_{i,m_i}| \le 17$
$A_{i,m_i}$ consists of lowercase letters and has at most 17 characters.

Data 1

1 $B_i$

Sushi topping $Ｂｉ$ passes seats 1 through n in order. If it passes in front of a customer who has it on their list, that customer takes it, and exactly one of that topping is removed from their list. For example, when a customer takes horse mackerel, two on the list become one, and one becomes zero and disappears.
$B_i$ is the name of a sushi topping in lowercase letters.

Data 2

2 $C_i$

The customer in seat $C_i$ goes to pay the bill, and that customer's list of foods they want to eat disappears.

$1 \le C_i \le 20$

Output

$b1$
$\dots$
$bx$
Print a newline at the end.

Each output $bi$ is the seat number, on one line, of the customer who takes the plate when Data 1 is given.
If the plate goes all the way around without any customer taking it, it is discarded; output -1.

Sample

11
1 toro
1 unagi
0 14 4 maguroakami hotatekai unagi maguroakami
1 saamonnmottu
1 unagi
1 unagi
1 maguro
1 kouika
1 maguroakami
1 maguroakami
2 14

-1
-1
-1
14
-1
-1
-1
14
14

15
0 14 4 maguroakami hotatekai unagi maguroakami
1 hotatekai
1 hotatekai
0 15 3 maguroakami saamonnmottu hotatekai
1 hotatekai
1 saamonnmottu
1 unagi
1 unagi
1 maguro
1 kouika
1 maguroakami
2 14
1 maguroakami
1 maguroakami
2 15

14
-1
15
15
14
-1
-1
-1
14
15
-1