A10515 | 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.

The first line of input contains two integers $n$ and $q$ ( $1<=n,q<=300000$ ) — 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 $type_{i}$ — type of the $i$ -th event. If $type_{i}=1$ or $type_{i}=2$ then it is followed by an integer $x_{i}$ . Otherwise it is followed by an integer $t_{i}$ ( $1<=type_{i}<=3,1<=x_{i}<=n,1<=t_{i}<=q$ ).

Print the number of unread notifications after each event.