Multiples of 3#2909
There are numbers a_0, a_1, \ldots, a_{n-1}. Initially, all are . You have to perform two types of operations:
Increase the numbers between indices and (inclusive) by . This is represented by the command 0 a b.
Answer how many numbers between indices and (inclusive) are divisible by . This is represented by the command 1 a b.
The first line contains two integers and (1 \leq n, q \leq 100\,000). Each of the next lines is either of the form 0 a b or 1 a b as mentioned above. It is known that 0 \leq a \leq b \leq n - 1.
Print one line for each query of the form 1 a b containing the required answer for the corresponding query.
Exemple 1