#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <cmath>

using namespace std;

typedef long long ll;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll n, x;
    cin >> n >> x;

    vector<ll> a(n + 1);
    vector<ll> part_sum(n + 1);
    map<ll, vector<ll>> indices_for_part_sum;

    part_sum[0] = 0;
    indices_for_part_sum[0].push_back(0);
    for (ll i = 1; i <= n; ++i) {
        cin >> a[i];
        part_sum[i] = part_sum[i - 1] + a[i];
        indices_for_part_sum[part_sum[i]].push_back(i);
    }

    ll res = 0;
    for (const auto& [ps, indices] : indices_for_part_sum) {
        ll required_value = ps - x;
        if (indices_for_part_sum.count(required_value) != 0) {
            for (const ll& index : indices) {
                auto tmp = lower_bound(
                        indices_for_part_sum[required_value].begin(),
                        indices_for_part_sum[required_value].end(),
                        index
                );
                res += tmp - indices_for_part_sum[required_value].begin();
            }
        }
    }

    cout << res << endl;

    return 0;
}