B'There are n pairwise-distinct points and a line x+y=k on a two-dimensional plane. The i -th point is at (x_i,y_i) . All points have non-negative coordinates and are strictly below the line. Alternatively, 0 <= q x_i,y_i, x_i+y_i < k . Tenzing wants to erase all the points. He can perform the following two operations: The blue area of the following picture describes the triangle with a=1,b=1 with cost =1 cdot A . Help Tenzing find the minimum cost to erase all of the points. The first line of the input contains three integers n , k and A ( 1 <= q n,k <= q 2 cdot 10^5 , 1 <= q A <= q 10^4 ) -- the number of points, the coefficient describing the hypotenuse of the triangle and the coefficient describing the cost of drawing a triangle. The following n lines of the input the i -th line contains three integers x_i,y_i,c_i ( 0 <= q x_i,y_i,x_i+y_i< k , 1 <= q c_i <= q 10^4 ) -- the coordinate of the i -th points and the cost of erasing it using the second operation. It is guaranteed that the coordinates are pairwise distinct. Output a single integer --the minimum cost needed to erase all of the points. The picture of the first example: Tenzing do the following operations: The picture of the second example: '...