B"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: 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 <= n <= 2 cdot 10^5 ; 1 <= q <= 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 <= a_i <= 10^5 ; 1 <= w_i, v_i <= 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 <= t <= 3 ) -- the type of query. If t=1 , then two integers k_i , d_i follow ( 1 <= k_i <= 10^5 ; 1 <= d_i <= 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 <= k_i <= 10^5 ; 1 <= d_i <= 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 <= c_i <= 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 ). For the first query where t=3 , Phoenix can fit 2 "...