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 :

  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

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


Added by:Varun Jalan
Date:2010-09-12
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS OBJC VB.NET
Resource:own problem

hide comments
2013-06-07 09:05:33 jalaj
no need of fast i/o..
2013-06-03 18:45:44 Abhishek
for optimized code use inline functions.. without it i was getting TLE..
2013-06-02 14:40:05 savage
Can't believe this, but this has been the first problem that I have faced where fast I/O and inline functions were the difference between AC and TLE .... guys go for fast I/O ...
2013-05-19 00:48:42 mpvd
anything special about 9th test case .getting wrong answer at 9th test case??
2013-04-17 16:52:58 :-)
stupid lime limit
2013-03-22 21:58:45 ALI HASAN
only one test case ?
2013-02-18 14:30:31 Ze0nC
Is it possible to get AC with Python?
btw, is it faster to use stdin than raw_input?
2013-02-10 20:33:08 Gary Ye
The time limit is indeed really strict.
I did it like people said in the comment section and wrote an own reading function with gethar_unlocked() and my solution got AC.

Last edit: 2013-02-10 20:33:37
2012-12-19 07:22:46 gourav
piece of cake if you have done atleast one question on segment tree ;)
2012-12-11 17:46:55 npsabari
<No spoilers in comments>

Last edit: 2012-12-12 07:45:33
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.