Count Of Substrings

$3$ mark

Problem tement

tou are pretring str of length in and an integer k$.$ Your task is to count and print the number of substrings of str which contain at most k Os and at most k $1$s$.$ Nata: $20$ then print

Input Format:

The input consists of three lines

The first line contains an integer Le

The second line contains a space$-$separated integers repressenting the elements of the array arr.

The third iline contains the integer k$..$

The input will be read from the STDIN by the candidate

X

$2$

Output Format:

Pret the number of substrings of str which contain at most k Os and at most k Is$.$ The autput will be matched to the candidate's output printed on the STDOUT