Given an integer array nums and two integers k and p, return the number of distinct subarrays that contain at most k elements divisible by p.

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

Note: Two subarrays are considered distinct if they have different lengths or contain different elements at corresponding positions.

Constraints:

• $1 \leq$ nums.length $\leq 200$

• $1 \leq$ nums[i], p $\leq 200$

• $1 \leq$ k $\leq$ nums.length

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.