MULTQ3  Multiples of 3
There are N numbers a[0], a[1] ... a[N  1]. Initially all are 0. You have to perform two types of operations :
 Increase the numbers between indices A and B (inclusive) by 1. This is represented by the command "0 A B"
 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
Input: 4 7 1 0 3 0 1 2 0 1 3 1 0 0 0 0 3 1 3 3 1 0 3 Output: 4 1 0 2
Constraints
1 ≤ N ≤ 100000
1 ≤ Q ≤ 100000
0 ≤ A ≤ B ≤ N  1
hide comments
epsilon:
20150826 13:48:38
thanks to vimarsh for fast i/o


karthik1997:
20150809 01:01:10
o(n) algo +fast i/o needed


shakaal:
20150112 22:03:25
truly teaches u the concept fastIO,lazy,segment tree and finally AC 

Eddy Cael:
20150107 21:02:11
No necesary fast I/O. I got AC with ordinary Segment Tree + Lazy + cin/cout in 4.60 s.


Deepanker Aggarwal:
20141231 01:40:47
Time Limit for languages like Java should be increased


Vaibhav Gosain:
20141224 09:08:32
time limit is a little too tight ;) 

anonymous:
20140703 01:14:13
same code AC in C++ gives tle in c... 

GURVINDER SINGH:
20140528 16:03:23
AC in first attempt no need of fast i/o


nitesh kumar:
20140403 20:38:40
got AC after faster I/O.. 
Added by:  Varun Jalan 
Date:  20100912 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS OBJC VB.NET 
Resource:  own problem 