Bitwise Equations#1550
You are given two positive integers and . Find the -th smallest positive integer (where is -based) such that the following equation holds:
where '' denotes the bitwise OR operator.
Each line contains two integers and (1 \leq x,\ k \leq 2 \times 10^9). Each line represents a separate test case.
For each test case, print the -th smallest positive integer (in a separate line) that satisfies the equation above.
Example 1