CodeForces 705C

C. Thor

Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can’t count the number of unread notifications generated by those applications (maybe Loki put a curse on it so he can’t).

q events are about to happen (in chronological order). They are of three types:

1. Application x generates a notification (this new notification is unread).
2. Thor reads all notifications generated so far by application x (he may re-read some notifications).
3. Thor reads the first t notifications generated by phone applications (notifications generated in first t events of the first type). It’s guaranteed that there were at least t events of the first type before this event. Please note that he doesn’t read first t unread notifications, he just reads the very first t notifications generated on his phone and he may re-read some of them in this operation.

Please help Thor and tell him the number of unread notifications after each event. You may assume that initially there are no notifications in the phone.

Input

The first line of input contains two integers n and q (1 ≤ n, q ≤ 300 000) — the number of applications and the number of events to happen.

The next q lines contain the events. The i-th of these lines starts with an integer typei — type of the i-th event. If typei = 1 or typei = 2 then it is followed by an integer xi. Otherwise it is followed by an integer ti (1 ≤ typei ≤ 3, 1 ≤ xi ≤ n, 1 ≤ ti ≤ q).

Output

Print the number of unread notifications after each event.

Examples

Input
3 4
1 3
1 1
1 2
2 3
Output
1
2
3
2

Input
4 6
1 2
1 4
1 2
3 3
1 3
1 3
Output
1
2
3
0
1
2

Note

In the first sample:

1. Application 3 generates a notification (there is 1 unread notification).
2. Application 1 generates a notification (there are 2 unread notifications).
3. Application 2 generates a notification (there are 3 unread notifications).
4. Thor reads the notification generated by application 3, there are 2 unread notifications left.

In the second sample test:

1. Application 2 generates a notification (there is 1 unread notification).
2. Application 4 generates a notification (there are 2 unread notifications).
3. Application 2 generates a notification (there are 3 unread notifications).
4. Thor reads first three notifications and since there are only three of them so far, there will be no unread notification left.
5. Application 3 generates a notification (there is 1 unread notification).
6. Application 3 generates a notification (there are 2 unread notifications).

思路

题目大意是托尔看信息，每次操作，有三种情况，弹出一条新信息，看完某个App的所有信息，看完前t条信息。
我把这道题当作一道模拟题，在不打算用队列的情况下，用一个数组记录每个信息位置的反向索引，单独看某个App的时候，从后往前找（第一个App的第一条信息在1号位，第二条在3号位，第三条在4号位，那么我找的过程：4→3→1），再用一个数组判断是否已读，并设置一个标记，以免下次读前t条是重复循环。但是一直TLE，原因不明。
我百度了一些大佬的博客，看过之后，模仿写的代码总是TLE和WA的情况。对题目和大佬的解法都能够完全理解，但是错因不明，最后看到一个对我来说最好理解的博客，码一下。

链接

Codeforces 705C Thor （模拟） - 我要加油了，因为我还有很多NB的梦想！ - CSDN博客

题目来源

CodeForces 705C Thor