B'There are n cities in a row numbered from 1 to n . The cities will be building broadcasting stations. The station in the i -th city has height h_i and range w_i . It can broadcast information to city j if the following constraints are met: At the beginning, for every city i , h_i = 0 and w_i = i . Then q events will take place. During i -th event one of the following will happen: Your task is to react to all events and print answers to all queries. The first line contains two integers n and q ( 1 <= n, q <= 2 cdot10^5 ) -- number of cities and number of events. Then q lines follow. The i -th line begins with an integer p_i ( p_i = 1 or p_i = 2 ). If p_i = 1 a station will be rebuilt. Then two integers c_i and g_i ( 1 <= c_i <= g_i <= n ) follow -- the city in which the station is rebuilt and its new broadcasting range. If p_i = 2 you are given a query. Then two integers l_i and r_i ( 1 <= l_i <= r_i <= n ) follow -- the range of cities in the query. For each query, print in a single line the sum of b_j over the given interval. In the first test case, only station 1 reaches city 1 before and after it is rebuilt. In the second test case, after each rebuild, the array b looks as follows: '...