CF1580C.Train Maintenance

Kawasiro Nitori is excellent in engineering. Thus she has been appointed to help maintain trains.

There are $n$ models of trains, and Nitori's department will only have at most one train of each model at any moment. In the beginning, there are no trains, at each of the following $m$ days, one train will be added, or one train will be removed. When a train of model $i$ is added at day $t$, it works for $x_i$ days (day $t$ inclusive), then it is in maintenance for $y_i$ days, then in work for $x_i$ days again, and so on until it is removed.

In order to make management easier, Nitori wants you to help her calculate how many trains are in maintenance in each day.

On a day a train is removed, it is not counted as in maintenance.

河城荷取在工程学方面十分出色，因此被委任协助维护列车。

共有 $n$ 种型号的列车，而荷取所在的部门在任意时刻每种型号最多只拥有一列列车。初始时没有列车；在接下来的 $m$ 天中，每天将新增一列列车，或移除一列列车。当型号为 $i$ 的列车于第 $t$ 天加入时，它将工作 $x_i$ 天（包含第 $t$ 天），随后进入为期 $y_i$ 天的维修期，接着再工作 $x_i$ 天，依此类推，直至该列车被移除。

为便于管理，荷取希望你帮她计算每一天处于维修状态的列车数量。

在列车被移除的当天，该列车不计入维修状态。

The first line contains two integers $n$, $m$ ($1 \le n,m \le 2 \cdot 10^5$).

The $i$-th of the next $n$ lines contains two integers $x_i,y_i$ ($1 \le x_i,y_i \le 10^9$).

Each of the next $m$ lines contains two integers $op$, $k$ ($1 \le k \le n$, $op = 1$ or $op = 2$). If $op=1$, it means this day's a train of model $k$ is added, otherwise the train of model $k$ is removed. It is guaranteed that when a train of model $x$ is added, there is no train of the same model in the department, and when a train of model $x$ is removed, there is such a train in the department.

第一行包含两个整数 $n$、$m$（$1 \le n,m \le 2 \cdot 10^5$）。

接下来的 $n$ 行中，第 $i$ 行包含两个整数 $x_i$、$y_i$（$1 \le x_i,y_i \le 10^9$）。

接下来的 $m$ 行中，每行包含两个整数 $op$、$k$（$1 \le k \le n$，且 $op = 1$ 或 $op = 2$）。若 $op=1$，表示当天新增一辆型号为 $k$ 的列车；否则（即 $op=2$），表示当天移除一辆型号为 $k$ 的列车。保证：当型号为 $x$ 的列车被添加时，该部门中不存在同型号的列车；当型号为 $x$ 的列车被移除时，该部门中确实存在一辆同型号的列车。

Print $m$ lines, The $i$-th of these lines contains one integers, denoting the number of trains in maintenance in the $i$-th day.

输出 $m$ 行，其中第 $i$ 行包含一个整数，表示第 $i$ 天处于维护状态的列车数量。

Consider the first example:

The first day: Nitori adds a train of model $3$. Only a train of model $3$ is running and no train is in maintenance.

The second day: Nitori adds a train of model $1$. A train of model $1$ is running and a train of model $3$ is in maintenance.

The third day: Nitori removes a train of model $1$. The situation is the same as the first day.

The fourth day: Nitori removes a train of model $3$. There are no trains at all.

考虑第一个例子：

第一天：Nitori 添加了一列型号为 $3$ 的列车。此时仅有一列型号为 $3$ 的列车在运行，且没有列车处于维修状态。

第二天：Nitori 添加了一列型号为 $1$ 的列车。此时一列型号为 $1$ 的列车在运行，而一列型号为 $3$ 的列车处于维修状态。

第三天：Nitori 移除了一列型号为 $1$ 的列车。此时的情形与第一天相同。

第四天：Nitori 移除了一列型号为 $3$ 的列车。此时已没有任何列车。