#58 Dadas and Friends

Statement

Statement language

After entering Seondeok High School, Dadas wants to make new friends in the classroom during breaks.

The classroom is initially empty, but as time passes, many students enter and leave. Dadas is lazy, so instead of going outside the classroom, Dadas wants to become friends with students who enter the classroom by playing with them. Since Dadas is very sociable, whenever Dadas plays, every student currently in the classroom instantly becomes Dadas's friend.

There are $N$ students other than Dadas, numbered from $1$ to $N$ . Initially, none of them is Dadas's friend.

Process the following $Q$ queries.

1 i: Student $i$ enters the classroom.
2 i: Student $i$ leaves the classroom.
3: Dadas plays with the students in the classroom. Every student currently in the classroom becomes Dadas's friend.
4: Print the current number of Dadas's friends.

All queries are consistent with the actual classroom state. That is, a student who is already in the classroom will not enter again, and a student who is outside the classroom will not leave.

Input

The input is given in the following format.

$N\ Q$ $S_1$ $S_2$

Output

For each query of type 4, print the current number of Dadas's friends on its own line.

Constraints

$1 \le N \le 200\,000$ .
$1 \le Q \le 500\,000$ .
In queries of the form 1 i or 2 i, .

Subtasks

#	Score	Constraints
1	100	Full constraints.

Samples

Sample 1

Input

Output

0
2
3

At the first query of type 4, Dadas has no friends yet.

After playing, students $1$ and $2$ , who were in the classroom, become Dadas's friends.

Later, student $3$ enters the classroom and Dadas plays again, so the number of friends becomes $3$ .

Sample 2

Input

Output

0
1

During the first play query, the classroom is empty, so no new student becomes a friend.

Later, student is in the classroom when Dadas plays, so student becomes Dadas's friend.