#include <iostream>
#include <vector>
int main() {
int n, x;
std::cin >> n >> x;
std::vector<int> coduri(n);
for (int i = 0; i < n; ++i) {
std::cin >> coduri[i];
}
int count = 0; // contor pentru secvențele valide
// Iterăm prin toate secvențele de lungime x
for (int i = 0; i <= n - x; ++i) {
int numere_pare = 0;
int numere_impare = 0;
// Numărăm numerele pare și impare în secvența curentă
for (int j = 0; j < x; ++j) {
if (coduri[i + j] % 2 == 0) {
numere_pare++;
} else {
numere_impare++;
}
}
// Verificăm condiția
if (numere_pare == 2 * numere_impare) {
count++;
}
}
std::cout << count << std::endl; // afișăm rezultatul
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgoKaW50IG1haW4oKSB7CiAgICBpbnQgbiwgeDsKICAgIHN0ZDo6Y2luID4+IG4gPj4geDsKICAgIAogICAgc3RkOjp2ZWN0b3I8aW50PiBjb2R1cmkobik7CiAgICAKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgKytpKSB7CiAgICAgICAgc3RkOjpjaW4gPj4gY29kdXJpW2ldOwogICAgfQogICAgCiAgICBpbnQgY291bnQgPSAwOyAgLy8gY29udG9yIHBlbnRydSBzZWN2ZW7Im2VsZSB2YWxpZGUKICAgIAogICAgLy8gSXRlcsSDbSBwcmluIHRvYXRlIHNlY3ZlbsibZWxlIGRlIGx1bmdpbWUgeAogICAgZm9yIChpbnQgaSA9IDA7IGkgPD0gbiAtIHg7ICsraSkgewogICAgICAgIGludCBudW1lcmVfcGFyZSA9IDA7CiAgICAgICAgaW50IG51bWVyZV9pbXBhcmUgPSAwOwogICAgICAgIAogICAgICAgIC8vIE51bcSDcsSDbSBudW1lcmVsZSBwYXJlIMiZaSBpbXBhcmUgw65uIHNlY3ZlbsibYSBjdXJlbnTEgwogICAgICAgIGZvciAoaW50IGogPSAwOyBqIDwgeDsgKytqKSB7CiAgICAgICAgICAgIGlmIChjb2R1cmlbaSArIGpdICUgMiA9PSAwKSB7CiAgICAgICAgICAgICAgICBudW1lcmVfcGFyZSsrOwogICAgICAgICAgICB9IGVsc2UgewogICAgICAgICAgICAgICAgbnVtZXJlX2ltcGFyZSsrOwogICAgICAgICAgICB9CiAgICAgICAgfQogICAgICAgIAogICAgICAgIC8vIFZlcmlmaWPEg20gY29uZGnIm2lhCiAgICAgICAgaWYgKG51bWVyZV9wYXJlID09IDIgKiBudW1lcmVfaW1wYXJlKSB7CiAgICAgICAgICAgIGNvdW50Kys7CiAgICAgICAgfQogICAgfQogICAgCiAgICBzdGQ6OmNvdXQgPDwgY291bnQgPDwgc3RkOjplbmRsOyAgLy8gYWZpyJnEg20gcmV6dWx0YXR1bAogICAgCiAgICByZXR1cm4gMDsKfQo=