B'The red pandas are in town to meet their relatives, the blue pandas! The town is modeled by a number line. The pandas have already planned their meetup, but the schedule keeps changing. You are given q updates of the form x t c. The updates will be given in order of non-decreasing x values. After each update, please print the maximum number of friendships if the red pandas move in an optimal order based on all the updates given in the input above (and including) this update. The order in which a red panda moves can change between updates. The first line contains q ( 1 <= q q <= q 2 cdot 10^5 ) xe2 x80 x93 the number of updates. The i -th line of the next q lines consists of 3 integers x_i , t_i and c_i ( 0 <= q x_i <= q 10^9 , 0 <= q t_i <= q 10^9 , 0 < |c_i| <= q 1000 ) xe2 x80 x93 the description of the i -th update. It is guaranteed that the x_i will be given in non-decreasing order. After each update, print the maximum number of friendships that can be formed. In the first example, the number of friendships after each update can be optimized as follows: '...