An array score is defined as the sum of the array elements multiplied by its length. For example, if the array is $[2, 1, 5]$, then its score is $(2 + 1 + 5) \times 3$ = $24$.

Given an array of positive integers, nums, and a positive integer k, count and return the number of non-empty subarrays of nums whose score is strictly less than k.

Note: A subarray is a contiguous sequence of elements within an array.

Constraints:

• $1 \leq$ nums.length $\leq 10^{3}$

• $1 \leq$ nums[i] $\leq 10^{3}$

• $1 \leq$ k $\leq 10^{5}$

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.