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

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

Vowels are the characters 'a', 'e', 'i', 'o', and 'u'. All other English lowercase letters are consonants.

A substring is considered beautiful if:

1. vowels $=$ consonants

2. (vowels $ imes$ consonants) $\\%$ k $= 0$

Return the total number of non empty beautiful substrings in s.

Constraints:

• $1 \leq$ s.length $\leq 1000$

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

• s consists of only English lowercase 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.