#include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
typedef long long LL;
int a[N], n, sum[N], k, h;
LL ans, f[N], g[N];
int main() {
    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
        sum[i] = sum[i - 1] + a[i];
        f[i] = 1;
    }
    h = 0;

    for (int i = 1; i <= n; ++i) {
        while (h <= n && sum[h] - sum[i - 1] <= k) ++h;
        ans += f[i] * (n - i + 1);
        f[h] += f[i];
    }
    cout << ans;
}