B"There is an infinite line consisting of cells. There are n boxes in some cells of this line. The i -th box stands in the cell a_i and has weight w_i . All a_i are distinct, moreover, a_{i - 1} < a_i holds for all valid i . You would like to put together some boxes. Putting together boxes with indices in the segment [l, r] means that you will move some of them in such a way that their positions will form some segment [x, x + (r - l)] . In one step you can move any box to a neighboring cell if it isn't occupied by another box (i.e. you can choose i and change a_i by 1 , all positions should remain distinct). You spend w_i units of energy moving the box i by one cell. You can move any box any number of times, in arbitrary order. Sometimes weights of some boxes change, so you have queries of two types: Note that you should minimize the answer, not its remainder modulo 10^9 + 7 . So if you have two possible answers 2 cdot 10^9 + 13 and 2 cdot 10^9 + 14 , you should choose the first one and print 10^9 + 6 , even though the remainder of the second answer is 0 . The first line contains two integers n and q ( 1 <= n, q <= 2 cdot 10^5 ) -- the number of boxes and the number of queries. The second line contains n integers a_1, a_2, ... a_n ( 1 <= a_i <= 10^9 ) -- the positions of the boxes. All a_i are distinct, a_{i - 1} < a_i holds for all valid i . The third line contains n integers w_1, w_2, ... w_n ( 1 <= w_i <= 10^9 ) -- the initial weights of the boxes. Next q lines describe queries, one query per line. Each query is described in a single line, containing two integers x and y . If x < 0 , then this query is of the first type, where id = -x , nw = y ( 1 <= id <= n , 1 <= nw <= 10^9 ). If x > 0 , then the query is of the second "...