You are given an integer array nums of length n and an integer m.

You need to determine if it is possible to split nums into n arrays of size $1$ through a sequence of split operations.

In each operation, you can choose any existing subarray of length at least $2$ and split it into two non empty subarrays. A split is valid if each of the two resulting subarrays satisfies at least one of the following conditions:

• The length of the subarray is $1$.

• The sum of the elements of the subarray is greater than or equal to m.

Return true if nums can be split into n arrays of size $1$, or false otherwise.

Constraints:

• $1 \leq n ==$ nums.length $\leq 100$

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

• $1 \leq$ m $\leq 200$

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.