B'AquaMoon gives RiverHamster a sequence of integers a_1,a_2, ... ,a_n , and RiverHamster gives you q queries. Each query is expressed by two integers l and r . For each query independently, you can take any continuous segment of the sequence and subtract an identical non-negative value from all the numbers of this segment. You can do so multiple (possibly, zero) times. However, you may not choose two intersecting segments which are not included in one another. Your goal is to convert to 0 all numbers whose initial value was within the range [l, r] . You must do so in the minimum number of operations. Please note that the queries are independent, the numbers in the array are restored to their initial values between the queries. Formally, for each query, you are to find the smallest m such that there exists a sequence {(x_j,y_j,z_j) }_{j=1}^{m} satisfying the following conditions: The first line contains two integers n and q ( 1 <= n,q <= 10^6 ). The second line contains n integers integers a_1, a_2, ldots, a_n ( 1 <= a_i <= n ). Each of the next q lines contains two integers l and r ( 1 <= l <= r <= n ), representing a query. For each query, output the answer for this query on a separate line. In the first test case, consider the second query, when l = 2 , r = 2 . The elements to be manipulated are [a_3, a_5, a_{10}] = [2, 2, 2] . It is sufficient to apply the operation sequence {(2, 10, 2) } . Consider the fourth query, when l = 2 , r = 3 . The elements to be manipulated are [a_3, a_4, a_5, a_7, a_{10}] = [2, 3, 2, 3, 2] . It is sufficient to apply the operation sequence {(1, 10, 2), (4, 4, 1), (7, 7, 1) } . In the second test case, note that the operation sequence {(1, 2, 1), (2, 3, 2) } is invalid because the two segments intersect but neither is contained inside the other. '...