B'You are given an n x n multiplication table and a positive integer m = m_1 cdot m_2 . A n x n multiplication table is a table with n rows and n columns numbered from 1 to n , where a_{i, j} = i cdot j . For each divisor d of m , check: does d occur in the table at least once, and if it does, what is the minimum row that contains d . The first line contains a single integer t ( 1 <= t <= 10 ) -- the number of test cases. The first and only line of each test case contains three integers n , m_1 and m_2 ( 1 <= n <= 10^9 ; 1 <= m_1, m_2 <= 10^9 ) -- the size of the multiplication table and the integer m represented as m_1 cdot m_2 . For each test case, let d_1, d_2, ... , d_k be all divisors of m sorted in the increasing order. And let a_1, a_2, ... , a_k be an array of answers, where a_i is equal to the minimum row index where divisor d_i occurs, or 0 , if there is no such row. Since array a may be large, first, print an integer s -- the number of divisors of m that are present in the n x n table. Next, print a single value X = a_1 oplus a_2 oplus ... oplus a_k , where oplus denotes the bitwise XOR operation. In the first test case, m = 72 cdot 1 = 72 and has 12 divisors [1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72] . The 3 x 3 multiplication table looks like that: For each divisor of m that is present in the table, the position with minimum row index is marked. So the array of answers a is equal to [1, 1, 1, 2, 2, 0, 3, 0, 0, 0, 0, 0] . There are only 6 non-zero values, and xor of a is equal to 2 . In the second test case, m = 10 cdot 15 = 150 and has 12 divisors [1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150] . All divisors except 75 and 150 are present i'...