B"Alice and Bob play a game on a grid with n rows and infinitely many columns. In each row, there are three tokens, blue, white and red one. Before the game starts and after every move, the following two conditions must hold: First, they pick a positive integer f , whose value is valid for the whole game. Second, the starting player is chosen and makes his or her first turn. Then players take alternating turns. The player who is unable to make a move loses. During a move, a player first selects an integer k that is either a prime number or a product of two (not necessarily distinct) primes. The smallest possible values of k are thus 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 17, 19, ... . Furthermore, k must not be equal to the previously picked integer f . Each turn, a move is performed in exactly one of the rows. If it is Alice's turn, she chooses a single blue token and moves it k cells to the right. Alternatively, she may move both the blue and the white token in the same row by the same amount k to the right. On the other hand, Bob selects a single red token and moves it k cells to the left. Similarly, he may also move the white and the red token in the corresponding row by k to the left. Note that Alice may never move a red token, while Bob may never move a blue one. Remember that after a move, the two conditions on relative positions of the tokens must still hold. Both players play optimally. Given the initial state of the board, determine who wins for two games: if Alice starts and if Bob starts. The first line contains a two integers n and f ( 1 <= q n <= q 10^5 , 2 <= q f <= q 2 cdot 10^5 ) -- the number of rows and the forbidden move, respectively. Each of the next n lines contains three integers b_i , w_i , r_i ( -10^5 <= q b_i < w_i < r_i <= q 10^5 ) -- the number of column in which the blue, white and red token lies in the $$"...