B"You are given a permutation a_1, a_2, ... , a_n of numbers from 1 to n . Also, you have n sets S_1,S_2, ... , S_n , where S_i= {a_i } . Lastly, you have a variable cnt , representing the current number of sets. Initially, cnt = n . We define two kinds of functions on sets: f(S)= min limits_{u in S} u ; g(S)= max limits_{u in S} u . You can obtain a new set by merging two sets A and B , if they satisfy g(A)<f(B) (Notice that the old sets do not disappear). Formally, you can perform the following sequence of operations: cnt gets cnt+1 ; S_{cnt}=S_u cup S_v , you are free to choose u and v for which 1 <= u, v < cnt and which satisfy g(S_u)<f(S_v) . You are required to obtain some specific sets. There are q requirements, each of which contains two integers l_i , r_i , which means that there must exist a set S_{k_i} ( k_i is the ID of the set, you should determine it) which equals {a_u mid l_i <= q u <= q r_i } , which is, the set consisting of all a_i with indices between l_i and r_i . In the end you must ensure that cnt <= q 2.2 x 10^6 . Note that you don't have to minimize cnt . It is guaranteed that a solution under given constraints exists. The first line contains two integers n,q (1 <= q n <= q 2^{12},1 <= q q <= q 2^{16}) -- the length of the permutation and the number of needed sets correspondently. The next line consists of n integers a_1,a_2, cdots, a_n ( 1 <= q a_i <= q n , a_i are pairwise distinct) -- given permutation. i -th of the next q lines contains two integers l_i,r_i (1 <= q l_i <= q r_i <= q n) , describing a requirement of the i -th set. It is guaranteed that a solution under given constraints exists. The first line should contain one integer cnt_E (n <= q cnt_E <= q 2.2 x 10^6) , representing the number "...