B'This is an unusual problem in an unusual contest, here is the announcement: http://codeforces.com/blog/entry/73543 You are given an array A of length n , initially filled with zeros. You need to process q queries to the array, each of one of the following types: The first line contains an integer T ( 1 <= q T <= q 10^5 ) -- the number of test cases. Each test case description starts with two integers n, q ( 1 <= q n, q <= q 10^5 ) -- the length of the array and the number of queries. The following q lines contain the description of queries: 1~x~y ( 1 <= q x <= q n , 0 <= q y <= q 10^9 ) for queries of the first type and 2~l~r ( 1 <= q l <= q r <= q n ) for queries of the second type. It is guaranteed that the sum of n as well as the sum of q does not exceed 10^6 . For each query of the second type print its result on a separate line. '...