B"Alice and Bob are playing a game (yet again). They have two sequences of segments of the coordinate axis: a sequence of n initial segments: [l_1, r_1] , [l_2, r_2] , ..., [l_n, r_n] , and a sequence of m terminal segments: [L_1, R_1] , [L_2, R_2] , ..., [L_m, R_m] . At the beginning of the game, they choose one of the initial segments and set it as the current segment. Alice and Bob make alternating moves: Alice makes the first move, Bob makes the second move, Alice makes the third one, and so on. During each move, the current player must shrink the current segment either by increasing its left endpoint by 1 , or by decreasing its right endpoint by 1 . So, if the current segment is [c_l, c_r] , it becomes either [c_l + 1, c_r] , or [c_l, c_r - 1] . If at the beginning of the game or after Bob's move the current segment coincides with one of the terminal segments, Bob wins. If the current segment becomes degenerate ( c_l = c_r ), and Bob hasn't won yet, Alice wins. If the current segment coincides with one of the terminal segments after Alice's move, nothing happens -- the game continues. Both players play optimally -- if they can win, they always use a strategy that leads them to victory in the minimum number of turns, and if they cannot win, they try to prolong the game, using the strategy allowing them to make the maximum possible number of moves until their defeat. For each of the initial segments you have to determine who will win the game if this segment is chosen as the current segment at the beginning of the game. If Bob wins, you also have to calculate the number of moves Alice will make before her defeat. The first line contains two integers n and m ( 1 <= n, m <= 2 cdot 10^5 ) -- the number of initial segments and terminal segments, respectively. Then n lines follow, the i -th line contains two integers l_i and r_i ( 1 <= l_i < r"...