Silver's strange exam

Silver is the teaching assistant for a university course and likes guessing games. To keep students enjoying the lab, Silver decided to score their lab points in a strange way.

Each student may enter and leave the lab freely, but once a student leaves, they cannot come back. When entering, a student writes an integer from $1$ to $1\,000\,000$ on a sheet of paper and brings it in. During the lab, Silver opens a strange event. When the event opens, each student currently in the lab scores as follows.

• If the integer they wrote is the same as another person's integer in the lab, they score nothing.
• If the integer they wrote is different from every other person's integer in the lab, they score $1$ point.
• Among the students whose integers are unique in the lab, the one who wrote the largest number gets $s$ extra points, for a total of $1+s$. The value of $s$ may differ for each event. If no student has a unique integer, nobody scores extra.

Silver recorded the entries, exits, and strange events as $Q$ queries. Each query has one of the following forms.

• $1\ x$: A student holding the integer $x$ enters the lab.
• $2\ k$: The student who was the $k$-th to enter overall leaves the lab. The count includes students who left earlier. The $k$-th student is in the lab at this moment.
• $3\ s$: A strange event opens. Each student in the lab whose integer is unique in the lab gets $1$ point. The student with the largest such integer gets $s$ more points.

After processing all queries in order, write a program that outputs the scores of the 1st through $N$-th students to enter, in order, where $N$ is the number of type $1$ queries.

The first line contains the number of queries $Q$. ($1\le Q\le 500\,000$)

Each of the next $Q$ lines contains one query, which is $1\ x$, $2\ k$, or $3\ s$.

• There is at least one type $1$ query.
• For a type $1$ query, $1\le x\le 1\,000\,000$ and $x$ is an integer.
• For a type $2$ query, $1\le k$ and $k$ is an integer. The $k$-th student to enter is in the lab.
• For a type $3$ query, $1\le s\le 10^9$ and $s$ is an integer.

Print $N$ lines, where $N$ is the number of type $1$ queries.

On the $i$-th line, print the score of the $i$-th student to enter.