LITE - Light Switching



Farmer John tries to keep the cows sharp by letting them play with intellectual toys. One of the larger toys is the lights in the barn.  Each of the N (2 <= N <= 100,000) cow stalls conveniently numbered 1..N has a colorful light above it.

At the beginning of the evening, all the lights are off. The cows control the lights with a set of N pushbutton switches that toggle the lights; pushing switch i changes the state of light i from off to on or from on to off.

The cows read and execute a list of M (1 <= M <= 100,000) operations expressed as one of two integers (0 <= operation <= 1).

The first kind of operation (denoted by a 0 command) includes two subsequent integers S_i and E_i (1 <= S_i <= E_i <= N) that indicate a starting switch and ending switch. They execute the operation by pushing each pushbutton from S_i through E_i inclusive exactly once.

The second kind of operation (denoted by a 1 command) asks the cows to count how many lights are on in the range given by two integers S_i and E_i (1 <= S_i <= E_i <= N) which specify the inclusive range in which the cows should count the number of lights that are on.

Help FJ ensure the cows are getting the correct answer by processing the list and producing the proper counts.

Input


Line 1: Two space-separated integers: N and M
Lines 2..M+1: Each line represents an operation with three space-separated integers: operation, S_i, and E_i

Output

Lines 1..number of queries: For each output query, print the count as an integer by itself on a single line.

Example

Input:
4 5
0 1 2
0 2 4
1 2 3
0 2 4
1 1 4

Output:
1
2

hide comments
yaseenmollik: 2018-11-15 00:29:21

AC in 2 go -_- . Got TLE on first submission just for using cin, cout! Then used fast I/O and got accepted. Btw, it is my first problem using Lazy Propagation.

Last edit: 2018-11-15 00:31:00
pola_pawaad59: 2018-11-01 17:43:08

can anyone help me with this problem?

atharva_sarage: 2018-10-28 20:38:54

easy peasy lemon squeezy

ihg_2_26: 2018-10-06 15:35:36

ez pz

lamia2658: 2018-06-13 21:05:46

if(lazy[node]%2 == 1)
{
do swap on and off
and rest are same
}
AC in one go

dipankar12: 2018-04-03 13:31:36

Time limit for JAVA is not correct. Got the same code AC with cpp

vivek_shah98: 2018-03-25 04:54:54

Same as FLIPCOIN problem on Codechef....
https://www.codechef.com/problems/FLIPCOIN/

imperfectboy: 2018-03-15 14:05:37

changing cout to printf ==== time 0.65---->0.35 !!!!

imperfectboy: 2018-03-15 13:49:52

first lazy propagation problem !! phewww

hitman007: 2018-02-11 18:44:06

Anyone got accepted in Java ? I am getting TLE at test# 10.


Added by:Iqram Mahmud
Date:2010-09-03
Time limit:0.165s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: OBJC VB.NET
Resource:USACO November 08