Problem:

Given an array of n integers and q queries of the form: Q(L, R, x). For each query Q(L, R, x), you have to say "How many integers in the range L to R(inclusive) which are less than x".

There is no update operation.

Constraints:

• 1 ≤ n ≤ 1900000
• 1 ≤ q ≤ 10⁵

If I use Square Root Decomposition, complexity will be O(q * sqrt(n) * logn), which is not so good for this constraints, I think.

Can you please suggest any better solution for this problem ?

Thanks in advance.