// Arup Guha
// 2/18/2024
// Solution to Kattis Problem: Count Doubles
// https://open.kattis.com/problems/countdoubles

import java.util.*;

public class countdoubles {

	public static void main(String[] args) {
	
		// Get basic data.
		Scanner stdin = new Scanner(System.in);
		int n = stdin.nextInt();	
		int m = stdin.nextInt();
		int[] arr = new int[n+1];
		
		// Read in even and odd into 1-based indexes.
		for (int i=1; i<=n; i++) 
			arr[i] = stdin.nextInt()%2 == 0 ? 1 : 0;
		
		// Make cumulative frequency.
		for (int i=1; i<=n; i++)
			arr[i] += arr[i-1];
			
		int res = 0;
		
		// Now look at each contiguous subarray and if it has 2 or more evens,
		// update our accumulator.
		for (int i=m; i<=n; i++)
			if (arr[i] - arr[i-m] >= 2)
				res++;
			
		// Ta da!
		System.out.println(res);
	}
}
		
