You are given a $2$D integer array rectangles where rectangles[i] = [l_i, h_i] indicates that the $i^{ ext{th}}$ rectangle has a bottom left corner at $(0, 0)$ and a top right corner at $(l_i, h_i)$.

You are also given a $2$D integer array points where points[j] = [x_j, y_j] is a coordinate on the Cartesian plane.

The $i^{ ext{th}}$ rectangle contains the $j^{ ext{th}}$ point if $0 \leq x_j \leq l_i$ and $0 \leq y_j \leq h_i$.

Return an integer array ans of length equal to points.length, where ans[j] is the number of rectangles that contain the $j^{ ext{th}}$ point.

Note: A point that lies on the boundary of a rectangle is considered to be contained within the rectangle.

Constraints:

• $1 \leq$ rectangles.length, points.length $\leq 5 imes 10^4$

• rectangles[i].length $==$ points[j].length $== 2$

• $1 \leq l_i, x_j \leq 10^9$

• $1 \leq h_i, y_j \leq 100$

• All the rectangles are unique.

• All the points are unique.

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.