We have an array( $$$a$$$ ) of length $$$n$$$, all the elements are less than or equal to $$$n$$$, then we have to answer $$$q$$$ queries, each will be three numbers $$$x$$$, $$$l$$$, $$$r$$$, then you have to print $$$\displaystyle\sum\limits_{l \le i mod x \le r}a_i$$$, i.e print the sum of all $$$a_i$$$ for $$$1 \le i \le n$$$ and $$$i mod x$$$ is in range $$$[l..r]$$$. $$$0 \le l \le r < x \le n$$$ Then what if we had two queries, adding ranges and one mentioned above. I solved it in $$$O(n^2+q\sqrt{q}+q\sqrt{n})$$$, how to solve it faster. The first query can be changed a little bit, it can be like we have $$$k$$$, $$$x$$$, $$$l$$$, $$$r$$$, then print the same number but with $$$i > k$$$. $$$\le 0 \le k < n$$$