Given an array and two bounds low and high, count the pairs of indices (i, j) with i < j such that low <= nums[i] XOR nums[j] <= high.
Input: A JSON object {"nums": [<non-negative integers>], "low": <lower bound>, "high": <upper bound>}.
Output: Return the number of pairs whose XOR falls in [low, high].
Input: {"nums":[1,4,2,7],"low":2,"high":6}
Output: 6
Explanation: Three pairs have XOR within [2,6].Input: {"nums":[9,8,4,2,1],"low":5,"high":14}
Output: 8
Explanation: Eight pairs fall in the range.1 <= len(nums) <= 2 * 10^41 <= low <= high < 2^160 <= nums[i] < 2^16