#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[100004], a[100004];
void solve() {
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++){
cin >> a[i];
}
dp[0] = 0;
for (int i = 1; i <= n; i++){
dp[i] = dp[i - 1] + a[i];
}
ll tong = 0;
for (int i = 0; i < n; i++) {
ll dau = dp[i] + 1;
ll cuoi = dp[i] + k;
ll lo = lower_bound(dp + 1, dp + n + 1, dau) - dp;
ll hi = upper_bound(dp + 1, dp + n + 1, cuoi) - dp;
tong += hi - lo;
}
cout << tong;
}
int main() {
solve();
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKI2RlZmluZSBsbCBsb25nIGxvbmcKCmxsIGRwWzEwMDAwNF0sIGFbMTAwMDA0XTsKCnZvaWQgc29sdmUoKSB7CiAgICBsbCBuLCBrOwogICAgY2luID4+IG4gPj4gazsKICAgIGZvciAoaW50IGkgPSAxOyBpIDw9IG47IGkrKyl7CiAgICAgICAgY2luID4+IGFbaV07CiAgICB9CiAgICBkcFswXSA9IDA7CiAgICBmb3IgKGludCBpID0gMTsgaSA8PSBuOyBpKyspewogICAgICAgIGRwW2ldID0gZHBbaSAtIDFdICsgYVtpXTsKICAgIH0KICAgIGxsIHRvbmcgPSAwOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICBsbCBkYXUgPSBkcFtpXSArIDE7CiAgICAgICAgbGwgY3VvaSA9IGRwW2ldICsgazsKICAgICAgICBsbCBsbyA9IGxvd2VyX2JvdW5kKGRwICsgMSwgZHAgKyBuICsgMSwgZGF1KSAtIGRwOwogICAgICAgIGxsIGhpID0gdXBwZXJfYm91bmQoZHAgKyAxLCBkcCArIG4gKyAxLCBjdW9pKSAtIGRwOwogICAgICAgIHRvbmcgKz0gaGkgLSBsbzsKICAgIH0KICAgIGNvdXQgPDwgdG9uZzsKfQoKaW50IG1haW4oKSB7CiAgICBzb2x2ZSgpOwp9Cg==