Count of Substrings Containing Every Vowel and K Consonants I

Count the number of substrings of a lowercase string that contain each of the five vowels (a, e, i, o, u) at least once and contain exactly k consonants. With word length ≤ 250, this is essentially a substring-counting problem where you must track vowel coverage and consonant count (feasible with quadratic or sliding-window enumeration).