Count Beautiful Substrings I

Count the number of contiguous substrings of s where the number of vowels equals the number of consonants and the product of those counts is divisible by k. The core challenge is combining the equality constraint on counts with a modular divisibility condition to count eligible substrings efficiently across up to n=1000 characters.