Given an array of integers nums and two integers a and b, return the total number of valid subarrays.

A subarray is defined as valid if both of the following conditions are satisfied:

1. It contains at least $1$ odd integer.

2. The ratio of the number of even integers to the number of odd integers in the subarray does not exceed $\frac{a}{b}$ (that is, $\frac{ {even count}}{ {odd count}} \le \frac{a}{b}$).

Constraints:

• $1 \le$ nums.length $\le 10^5$

• $1 \le$ nums[i] $\le 10^9$

• $1 \le$ a, b $\le 10^9$

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.