The first line contains the number of scenarios.
Every scenario consists of a single line containing two integers i and j (1 <= i, j <= 2*109) that represent
a node (i, j). You can assume that this is a valid node in the binary tree described above.
The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing two numbers l and r separated by a single space, where l is how often you have to go left and r is how often you have to go right when traversing the tree from the root to the node given in the input. Print an empty line after every scenario.Sample Input
3 42 1 3 4 17 73Sample Output
Scenario #1: 41 0 Scenario #2: 2 1 Scenario #3: 4 6Source
TUD Programming Contest 2005 (Training Session), Darmstadt, Germany