PROGRAMMING:The path of binary tree
& nbsp;& nbsp;& nbsp; Binary tree is a common data structure. Given an infinite binary tree, nodes are identified as a pair of integers, and the structure is as follows: < br / >
& nbsp;& nbsp;& nbsp;（ 1) The root of the tree is identified as a pair of integers (1,1)< br/>
& nbsp;& nbsp;& nbsp;（ 2) If a node is identified as (a, b), its left subtree root is identified as (a + B, b), and its right subtree root is identified as (a, a + b)< br/>
& nbsp;& nbsp;& nbsp; Given a node ID (a, b) of the above binary tree, assuming that the shortest path from the tree root to the given node is taken, how many times can you give to go to the left subtree and how many times to go to the right subtree?
###Input format:
& nbsp;& nbsp;& nbsp; The first line gives the number of test cases. Each test case occupies one line, which is composed of two integers i and J (1 < = I, J < = 2 * 109), representing the identification of the node (I, J). It is assumed that all the given nodes are valid.
###Output format:
& nbsp;& nbsp;& nbsp; For each test case, the first line is "scenario # I:" where I is the test case number, starting from 1; Then output a line to give two integers L and R, separated by a space, where l is the number of times to walk to the left subtree from the tree root to the node, and R is the number of times to walk to the right subtree from the tree root to the node. Output a blank line at the end of each test case.
###Input example:
```in
three
53 6
7 8
27 95
```
###Output example:
```out
Scenario #1:
12 1
Scenario #2:
6 1
Scenario #3:
13 4
```
answer：If there is no answer, please comment
& nbsp;& nbsp;& nbsp;（ 1) The root of the tree is identified as a pair of integers (1,1)< br/>
& nbsp;& nbsp;& nbsp;（ 2) If a node is identified as (a, b), its left subtree root is identified as (a + B, b), and its right subtree root is identified as (a, a + b)< br/>
& nbsp;& nbsp;& nbsp; Given a node ID (a, b) of the above binary tree, assuming that the shortest path from the tree root to the given node is taken, how many times can you give to go to the left subtree and how many times to go to the right subtree?
###Input format:
& nbsp;& nbsp;& nbsp; The first line gives the number of test cases. Each test case occupies one line, which is composed of two integers i and J (1 < = I, J < = 2 * 109), representing the identification of the node (I, J). It is assumed that all the given nodes are valid.
###Output format:
& nbsp;& nbsp;& nbsp; For each test case, the first line is "scenario # I:" where I is the test case number, starting from 1; Then output a line to give two integers L and R, separated by a space, where l is the number of times to walk to the left subtree from the tree root to the node, and R is the number of times to walk to the right subtree from the tree root to the node. Output a blank line at the end of each test case.
###Input example:
```in
three
53 6
7 8
27 95
```
###Output example:
```out
Scenario #1:
12 1
Scenario #2:
6 1
Scenario #3:
13 4
```
answer：If there is no answer, please comment