B"Let's denote the Manhattan distance between two points p_1 (with coordinates (x_1, y_1) ) and p_2 (with coordinates (x_2, y_2) ) as d(p_1, p_2) = |x_1 - x_2| + |y_1 - y_2| . For example, the distance between two points with coordinates (1, 3) and (4, 2) is |1 - 4| + |3 - 2| = 4 . You are given two points, A and B . The point A has coordinates (0, 0) , the point B has coordinates (x, y) . Your goal is to find a point C such that: Find any point C that meets these constraints, or report that no such point exists. The first line contains one integer t ( 1 <= t <= 3000 ) -- the number of test cases. Each test case consists of one line containing two integers x and y ( 0 <= x, y <= 50 ) -- the coordinates of the point B . For each test case, print the answer on a separate line as follows: Explanations for some of the test cases from the example: "...