Bank Queue

Scrooge recently took a job as a guard at a bank. The work is dull, so he started watching the queue. At the start, $n$ people stand in line. Scrooge spent several years as a psychologist, so he can judge each person's mood quite accurately. He numbers people from the front starting at 0, so a person's number equals the count of people standing in front of them. He writes the mood of the $i$-th person as a non-negative integer $a_i$. A person is in a good mood if their mood is at least $x$, and in a bad mood otherwise.

People join the queue and leave it. When a new person joins, Scrooge judges their mood right away, and it does not change over time.

Scrooge has a new hobby. At certain moments he picks one person in the queue and counts how many people in good mood stand in front of that person. He finds this interesting and wants to automate it. Scrooge is not strong at programming, so he asked you for help. Help him!

The first line contains two integers $n$ and $x$ ($1 \le n \le 100\,000$, $0 \le x \le 10^9$): the initial number of people in the queue and the lower bound for a good mood.

The second line contains $n$ integers $a_i$ ($0 \le a_i \le 10^9$), the moods of the people in the queue.

The third line contains $m$ ($1 \le m \le 100\,000$), the number of events. Each of the next $m$ lines is one of the following:

1 $a$ ($0 \le a \le 10^9$): a person with mood $a$ joins the end of the queue.

2: the person at the front, who has no one in front of them (number 0), leaves. Afterwards Scrooge decreases everyone's number by 1.

3 $i$: Scrooge asks how many people in good mood stand in front of the person who has exactly $i$ people in front of them at this moment.

All queries are valid. If the queue is empty, event 2 is not performed. In a type 3 query, $i$ is always less than the current size of the queue.

For each query of type 3, print one line with the number of people in good mood who stand in front of the person with the given number.