Given array A of size N, and U updates, in each update there are three integers l,r,x means update all A[i], l<=i<=r with min(A[i],x). Then find new value of array A.

Constraints: 1<=A[i],x<=10^{9} ,1<=U,N<=100005, 1<=l,r<=N

Unable to find any O(nlogn) solution