Description

NK High School organizes students to participate in social practice activities at Wuyun Mountain Village, and as per tradition, they travel by train. Due to the large number of students at NK High School, it is essential to count the number of students accurately before the train departs.

Initially, there are no students on the train. As students begin to board, the grade director starts from the first carriage and walks toward the last. At any time, students may board or alight from any carriage. When the grade director reaches the $m$-th carriage, he wants to know the total number of students in the first $m$ carriages. However, he does not have the habit of turning back. This means that each time he asks a question, $m$ will always be greater than the previous value.

Input Format

The first line contains two integers, $n$ and $k$, representing the total number of train carriages and the number of events, respectively.

The next $k$ lines describe the $k$ events in chronological order. Each line starts with a letter A, B, or C.

• If the letter is A, it is followed by a number $m$, indicating that the grade director is now at the $m$-th carriage.
• If the letter is B, it is followed by two numbers $m$ and $p$, indicating that $p$ students board the $m$-th carriage.
• If the letter is C, it is followed by two numbers $m$ and $p$, indicating that $p$ students alight from the $m$-th carriage.

The total number of students will not exceed $10^5$.

Output Format

For each A, output a line containing an integer, which is the answer to the grade director's question.

Sample 1

10 7
A 1
B 1 1
B 3 1
B 4 1
A 2
A 3
A 10

0
1
2
3

Constraints and Hints

For $30\%$ of the data, $1\le n,k\le 10^4$, with at least $3000$ A events.

For $100\%$ of the data, $1\le n\le 5\times 10^5,1\le k\le 10^5$, with at least $3\times 10^4$ A events.