Given an array A of N elements. Here A[i] denotes the height of ith plant. There are Q queries of 3 types: 1. CUT h: Here for all plants with height greater than h ,cut them to height h. 2. GROW i x: Increase the height of ith plant by x. 3. MAGIC y: Increase the height of all plants by y.

For each query of type 1 , we have to print the total length of plants that is to be cut . Please suggest some approach to solve this problem.