Given two integers n and m, determine the minimum number of prime numbers chosen from the first m prime numbers that sum up to n. Each prime number may be used an unlimited number of times.

Constraints:

• $1 \leq$ n $\leq 1000$

• $1 \leq$ m $\leq 1000$

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.