For this Question: You are given a string of length N consisting of lowercase english alphabets(a-z), in which you are allowed to change at most k consonants into a vowel (a, e, i, o, u).
Find the longest substring that consists of only vowels after changing at most k consonants into vowels.First line of input consists of two integers N and k.
Second line consists of a string of length N.

Constraints:-
0 <= N <= 10^5
0 <= k <= N

String will contain only lowercase english lettersA single integer showing the length of the longest substring consisting of only vowels.Sample Input:-
11 2
aoibbboeaub

Sample Output:-
6

Explanation:-
One of the possibility is:-
aoibbboeaub => aoibbeoeaue (two b(s) converted to e)

now the longest substring is *eoeaue* which consists of only vowels., I have written this Solution Code: 
		











n,k = map(int,input().split())

inp = input()
VOWELS = ["a","e","i","o","u"]
l = 0
h = 0
maxLength = 0
changes = 0
while h<n and l<n:
	if changes<=k:
		if inp[h] not in VOWELS:
			changes += 1
		h += 1
	elif changes>k:
		if inp[l] not in VOWELS:
			changes -= 1
		l+= 1
	if h-l > maxLength and changes<=k:
		maxLength = h-l

print(maxLength), In this Programming Language: Python, Now tell me if this Code is compilable or not?