Our friend Kaneki is going to be tortued by Jason. The method of torture is rather unique. So he is currently in a more dire situation compared to you guys ( Lucky you... :) ). The method of torture is using a centipied. Json likes to play games, so he decided to give Kaneki a last resort. If he can print the body of the cetipied, he is going to let him free. Since his hands and legs are tied, he asks you for help.

Help kaneki in finding the body of the centipied. The body of centipied is in form a path in a tree. (Don't worry, you won't actually need to know about tree in order to solve the question).

This tree is a binary tree of infinite size. First block is node 1. It has 2 child, 2 and 3. In general, suppose we are at block number x. Then the left child will have number 2x and the right child will have number 2x+1.

you are given the node of head and tail of centipied. You need to find the path such that the length of the centipied is smallest.

Constraints:
T - test cases: 10
A - Head of centipied: 1 <= A <= 1e18
B - Tail of centipied: 1 <= B <= 1e18