You are given two $0$ indexed integer arrays nums1 and nums2, each of length n, and a $2 D$ integer array queries where queries[i] $= [x_i, y_i]$.

For the $i^{th}$ query, find the maximum value of nums1[j] $+$ nums2[j] among all indices j ($0 \leq$ j $<$ n) such that nums1[j] $\geq x_i$ and nums2[j] $\geq y_i$. If no such index j exists, the answer for that query is $-1$.

Return an array answer where answer[i] is the answer to the $i^{ th}$ query.

Constraints:

• nums1.length $==$ nums2.length

• n $==$ nums1.length

• $1 \leq$ n $\leq 10^5$

• $1 \leq$ nums1[i], nums2[i] $\leq 10^9$

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

• queries[i].length $== 2$

• x_i $==$ queries[i][1]

• y_i $==$ queries[i][2]

• $1 \leq$ x_i, y_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.