## MULTQ3 - Multiples of 3

There are N numbers a,a..a[N - 1]. Initally all are 0. You have to perform two types of operations :

1) Increase the numbers between indices A and B (inclusive) by 1. This is represented by the command "0 A B"
2) Answer how many numbers between indices A and B (inclusive) are divisible by 3. This is represented by the command "1 A B".

### Input

The first line contains two integers, N and Q. Each of the next Q lines are either of the form "0 A B" or "1 A B" as mentioned above.

### Output

Output 1 line for each of the queries of the form "1 A B" containing the required answer for the corresponding query.

### Sample

```Sample Input :
4 7
1 0 3
0 1 2
0 1 3
1 0 0
0 0 3
1 3 3
1 0 3

Sample Output :
4
1
0
2```

### Constraints

1 <= N <= 100000
1 <= Q <= 100000
0 <= A <= B <= N - 1

 < Previous 1 2 3 4 5 6 7 8 9 10 Next > oldmonk: 2011-06-12 12:25:01 getting TLE suggest some method to make it faster paddyHOD: 2011-02-10 11:00:15 my answer is correct but it is giving time limit exceeded Anil Kishore: 2010-09-28 07:05:58 yes it is, thats why the first query "1 0 3" ( how many of A[0..3] are divisble by 3 ) returns 4 ( all 0s initially ) Seshadri R: 2010-09-28 07:05:58 Is zero considered to be divisible by 3? Otherwise, how can the first Sample output be explained?