#include <iostream>

using namespace std;

typedef long long ll;

ll n, k, ans = 0;
const int maxn = 100005;
ll vv[maxn], p[maxn];

void input() {
    cin >> n >> k;
    for (ll i = 0; i < n; ++i) {
        cin >> vv[i];
    }
}

void solve() {
    for (ll i = 1; i < n + 10; ++i) {
        p[i] = p[i - 1] + vv[i - 1];
    }
    ll it1 = 0, it2 = 0 ;
    while (it2 < n + 10) {
        if (p[it2] - p[it1] >= k) {
            if (p[it2] - p[it1] == k)
                ans++;
            ++it1;
        } else ++it2;
    }
}

int main() {
    input();
    solve();
    cout << ans << endl;
}