Phoenix and Diamonds

$n$ 种钻石，一颗第 $i$ 种钻石重量为 $w_i$，价值为 $v_i$，一开始第 $i$ 种钻石的库存为 $a_i$。接下来进行 $m$ 次操作： - `1 k d`：进货了 $k$ 个种类为 $d$ 的钻石； - `2 k d`：卖出了 $k$ 个种类为 $d$ 的钻石； - `3 c`：如果你有一个大小为 $c$ 的袋子，且按照第一关键字为价值（从大到小），第二关键字为重量（从小到大）的顺序取钻石的话，你最终可以取到钻石的价值为多少（注意操作不会真正执行） $1\leq n\leq 2\times 10^5$，$1\leq m\leq 10^5$，$1\leq k,d,a_i\leq 10^5$，$1\leq c\leq 10^{18}$。

Phoenix wonders what it is like to rob diamonds from a jewelry store! There are $ n $ types of diamonds. The $ i $ -th type has weight $ w_i $ and value $ v_i $ . The store initially has $ a_i $ diamonds of the $ i $ -th type. Each day, for $ q $ days, one of the following will happen: 1. A new shipment of $ k_i $ diamonds of type $ d_i $ arrive. 2. The store sells $ k_i $ diamonds of type $ d_i $ . 3. Phoenix wonders what will happen if he robs the store using a bag that can fit diamonds with total weight not exceeding $ c_i $ . If he greedily takes diamonds of the largest value that fit, how much value would be taken? If there are multiple diamonds with the largest value, he will take the one with minimum weight. If, of the diamonds with the largest value, there are multiple with the same minimum weight, he will take any of them. Of course, since Phoenix is a law-abiding citizen, this is all a thought experiment and he never actually robs any diamonds from the store. This means that queries of type $ 3 $ do not affect the diamonds in the store.

The first line contains two integers $ n $ and $ q $ ( $ 1 \le n \le 2 \cdot 10^5 $ ; $ 1 \le q \le 10^5 $ ) — the number of types of diamonds and number of days, respectively. The next $ n $ lines describe each type of diamond. The $ i $ -th line will contain three integers $ a_i $ , $ w_i $ , and $ v_i $ ( $ 0 \le a_i \le 10^5 $ ; $ 1 \le w_i, v_i \le 10^5 $ ) — the initial number of diamonds of the $ i $ -th type, the weight of diamonds of the $ i $ -th type, and the value of diamonds of the $ i $ -th type, respectively. The next $ q $ lines contain the queries. For each query, the first integer of each line is $ t $ ( $ 1 \le t \le 3 $ ) — the type of query. If $ t=1 $ , then two integers $ k_i $ , $ d_i $ follow ( $ 1 \le k_i \le 10^5 $ ; $ 1 \le d_i \le n $ ). This means that a new shipment of $ k_i $ diamonds arrived, each of type $ d_i $ . If $ t=2 $ , then two integers $ k_i $ , $ d_i $ follow ( $ 1 \le k_i \le 10^5 $ ; $ 1 \le d_i \le n $ ). This means that the store has sold $ k_i $ diamonds, each of type $ d_i $ . It is guaranteed that the store had the diamonds before they sold them. If $ t=3 $ , an integer $ c_i $ will follow ( $ 1 \le c_i \le 10^{18} $ ) — the weight capacity of Phoenix's bag. It is guaranteed that there is at least one query where $ t=3 $ .

Print the answer for each query of the third type ( $ t=3 $ ).

3 5
2 3 4
1 5 1
0 2 4
3 6
1 3 3
3 10
2 2 3
3 30

8
16
13

For the first query where $ t=3 $ , Phoenix can fit $ 2 $ diamonds of type $ 1 $ , with total weight $ 6 $ and value $ 8 $ . For the second query where $ t=3 $ , Phoenix will first fit in $ 3 $ diamonds of type $ 3 $ , then one diamond of type $ 1 $ for a total weight of $ 9 $ and a value of $ 16 $ . Note that diamonds of type $ 3 $ are prioritized over type $ 1 $ because type $ 3 $ has equal value but less weight. For the final query where $ t=3 $ , Phoenix can fit every diamond for a total value of $ 13 $ .