Alice and Bob are playing a game involving two intervals, (l_1, r_1) and (l_2, r_2), constrained by integers (x_1) and (x_2) respectively. The intervals satisfy (1 \le l_1 \le r_1 \le x_1) and (1 \le l_2 \le r_2 \le x_2). The game is played as follows. In one turn, a player must choose one of the two intervals (let's say the (i)-th interval (l_i, r_i)) and perform exactly one of the following operations: Replace (l_i) with a strictly smaller integer (l'_i) such that (1 \le l'_i \lt l_i). Replace (r_i) with a strictly larger integer (r'_i) such that (r_i \lt r'_i \le x_i). The game setup proceeds in two steps: First, Alice chooses the values of (l_1) and (r_1) to determine the first interval. It must be a valid interval within (1, x_1). Then, the second interval (l_2, r_2) is chosen uniformly at random from all possible valid intervals within (1, x_2). Once the intervals are chosen, the game begins with Alice moving first . Assuming both Alice and Bob play optimally, Alice wants to choose the initial interval (l_1, r_1) to maximize her probability of winning. Your task is to find such an interval. If there are multiple optimal intervals, you may output any one of them. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The only line of each test case contains two integers (x_1) and (x_2) ((1 \le x_1, x_2 \le 5 \cdot 10^5)) — the upper bounds for the two intervals. It is guaranteed that the sum of (x_1) over all test cases does not exceed (5 \cdot 10^5). It is guaranteed that the sum of (x_2) over all test cases does not exceed (5 \cdot 10^5). For each test case, output two integers (l_1) and (r_1) ((1 \le l_1 \le r_1 \le x_1)) — the optimal interval chosen by Alice. If there are multiple optimal intervals, you ma