SUBSEQ

#include <bits/stdc++.h>
#define oo 999999999
#define MOD 1000000007
#define MAX 1000030

using namespace std;
typedef unsigned long long ull;

int n;
int m;
int a[MAX];
int cnt;

void output () {
    printf("%d", cnt);
}

void solve () {
    a[0] = 0;
    cnt = 0;
    int sum = 0;
    for (int i = 1; i <= n; ++i) {
        sum = 0;
        for (int j = i; j <= n; ++j) {
            sum += a[j];
            if (sum > m) {
                break;
            }
            // printf("%d %d\n", i, j);
            ++cnt;
        }
    }
}

void input () {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
    }
}

int main () {
    // freopen("inp", "r", stdin);
    // freopen("out", "w", stdout);
    input();
    solve();
    output();
    return 0;
}