You are given a string s and a positive integer k.

Let vowels and consonants denote the number of vowels and consonants in a substring, respectively.

A substring is considered beautiful if:

• vowels == consonants

• (vowels * consonants) % k $= 0$

Return the total number of nonempty beautiful substrings in s.

The English vowels are 'a', 'e', 'i', 'o', and 'u'. All other lowercase English letters are consonants.

A substring is a contiguous sequence of characters within a string.

Constraints:

• $1 \leq$ s.length $\leq 5 \times 10^4$

• $1 \leq$ k $\leq 1000$

• s consists of only lowercase English letters.

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.