Another Deli-ceilous problem!

Chef Avi is stuck on a not-so-trivial problem. His teacher gave him an array $A$ of size $N$ and $Q$ queries,each query containing 3 integers $X,L,R$. For each query help him find the value of $\sum_{i=L}^{R}ceil(X/A_i)$, where $ceil(x)$ is the smallest integer greater than or equal to $x$. Note that it is a 1-indexed array. ###Input: - First line will contain two integers $N$ and $Q$.