Codeforces Round #366 (Div. 2) C. Thor （模拟）

C. Thor

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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. Iftypei = 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).

自己做的时候没想到用队列， 我只想到了从3到2的影响的解决方案，想不出来从2的到3的解决方案。QAQ

本题用队列做。

对于1，用sum队列记录每个进入的编号 cnt++，同时每个应用也要开的队列，把此编号加入到每个应用的队列中。

对于2，开一个used数组，如果used[vis[y].front()]=0,那么此条消息没看过，更新used值，ans++, pop。

对于3，从总的队列sum出，直到队列为空或者当前编号小于y。

结果cnt-ans.

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
using namespace std;
const int maxn = 3e5+5;
queue<int> sum,vis[maxn];
int used[maxn];
int main()
{
    int n,q;
    cin>>n>>q;
    int ans = 0;
    int cnt = 0;
    int x,y;
    for(int i=1;i<=q;i++)
    {
        scanf("%d %d",&x,&y);
        if(x==1)
        {
            cnt++;
            vis[y].push(cnt);
            sum.push(cnt);
        }
        else if(x==2)
        {
            while(!vis[y].empty())
            {
                if(!used[vis[y].front()])
                {
                    used[vis[y].front()] = 1;
                    ans++;
                }
                vis[y].pop();
            }
        }
        else
        {
            while(!sum.empty()&&sum.front()<=y)
            {

                if(!used[sum.front()])
                {
                    used[sum.front()] = 1;
                    ans++;
                }
                sum.pop();
            }
        }
        printf("%d
",cnt-ans);
    }
    return 0;
}