You are given an integer array nums of length n and an integer array quantity of length m, where the $i^{ ext{th}}$ customer demands quantity[i] integers.

Each customer must receive all identical integers from nums. Each element from nums can be assigned to at most $1$ customer, and any remaining integers can be left unused.

Return true if it is possible to satisfy all $m$ customer requests, or false otherwise.

Constraints:

• n $==$ nums.length

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

• $1 \leq$ nums[i] $\leq 1000$

• m $==$ quantity.length

• $1 \leq m \leq 10$

• $1 \leq$ quantity[i] $\leq 10^5$

• There are at most $50$ unique values in nums.

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.