A fraction a/b (a < b) can be expressed in the way
1/b_1 + 1/b_2 + ... + 1/b_n.
Now can you achieve it and make the sum of b_1 to b_n minimum?
For each case there are tow positive intergers a and b (0 < a < b ≤ 100).
For each test case output the minimum sum.