For this Question: Given an array of size N consisting of only 0's and 1's, your task is to find the maximum number of consecutive's 1's you can get by flipping at most M 0'sFirst line of input contains two space separated integers denoting values of N and M, next line contains N space separated integer denoting the values of array.

Constraints:-
1 < = M < = N < = 100000
0 < = Arr[i] < = 1Print the maximum number of consecutive 1's.Sample Input:-
5 1
1 0 1 0 0

Sample Output:-
3

Sample Input:-
5 5
1 1 1 1 1

Sample Output:-
5, I have written this Solution Code: 
n,k = map(int, input().split())
arr = list(map(int, input().split()))
max_len = 0
j = 0
for i in range(len(arr)):
    if arr[i] == 0:
        k -= 1
    while k < 0:
        if arr[j] == 0:
            k += 1
        j += 1
    max_len = max(max_len, i-j+1)
print(max_len), In this Programming Language: Python, Now tell me if this Code is compilable or not?