I suggest you actually mean the following?

Operation 1: decrease the numbers greater than $$$x$$$ by $$$x$$$ in the interval $$$[l,r]$$$

You should frame the question better, 1.are the changes permanent,2.is x constant throughout the queries?

i think you can use sqrt decomposition to solve in $$$\mathcal{O}(n \sqrt{n} \log{n})$$$

basically, turn the array into blocks of size $$$\sqrt{n}$$$. in each block, store a map for $$$(\text{val}, \text{freq})$$$

updates: for each block, either lazily add +x to the entire block, or update specific elements.

queries: just iterate thru each block and add relevant values. we can handle stuff that isn't in a complete block separately