You are given an array nums consisting of non-negative integers. You are also given a $2$D array queries, where queries[i] = [x_i, m_i].

The answer to the $i^{ ext{th}}$ query is the maximum bitwise XOR value of x_i with any element in nums that is less than or equal to m_i. Formally, the answer is the maximum value of nums[j] $\oplus$ x_i for all indices j such that nums[j] $\leq$ m_i. If every element in nums is strictly greater than m_i, the answer to that query is $-1$.

Return an array containing the results of all queries in the corresponding order.

Constraints:

• $1 \leq$ nums.length, queries.length $\leq 10^5$

• queries[i].length $= 2$

• $0 \leq$ nums[j], x_i, m_i $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.