#include <iostream>
#include <queue>
#include <cassert>
using namespace std;
int N, L;
queue<int> que;
int val, ans;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N >> L;
for (int i = 0; i < L; i++) {
int x; cin >> x;
que.push(x);
val += x;
if (129 <= val && val <= 138) ans++;
}
for (int i = L; i < N; i++) {
val -= que.front();
que.pop();
int x; cin >> x;
que.push(x);
val += x;
if (129 <= val && val <= 138) ans++;
}
cout << ans;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8cXVldWU+CiNpbmNsdWRlIDxjYXNzZXJ0Pgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IE4sIEw7CnF1ZXVlPGludD4gcXVlOwppbnQgdmFsLCBhbnM7CgppbnQgbWFpbigpIHsKCWlvczo6c3luY193aXRoX3N0ZGlvKDApOwoJY2luLnRpZSgwKTsKCgljaW4gPj4gTiA+PiBMOwoJZm9yIChpbnQgaSA9IDA7IGkgPCBMOyBpKyspIHsKCQlpbnQgeDsgY2luID4+IHg7CgkJcXVlLnB1c2goeCk7CgkJdmFsICs9IHg7CgkJaWYgKDEyOSA8PSB2YWwgJiYgdmFsIDw9IDEzOCkgYW5zKys7Cgl9CgoJZm9yIChpbnQgaSA9IEw7IGkgPCBOOyBpKyspIHsKCQl2YWwgLT0gcXVlLmZyb250KCk7CgkJcXVlLnBvcCgpOwoKCQlpbnQgeDsgY2luID4+IHg7CgkJcXVlLnB1c2goeCk7CgkJdmFsICs9IHg7CgkJaWYgKDEyOSA8PSB2YWwgJiYgdmFsIDw9IDEzOCkgYW5zKys7Cgl9CgoJY291dCA8PCBhbnM7Cn0=