XOR profit problem

#1

In the xor profit problem in the constraint l and r is mentioned. What is this?

#2

you have to find the the two values a and b such that their xor is maximum and l<=a<=b<=r,
i.e., both a and b should be greater than or equal to l and less than or equal to r.