#include <iostream>
#include <vector>
#include <unordered_set>
using namespace std;
int main(){
    int n, k;
    cin>>n>>k;
    vector <long long> a(n);
    vector <long long> prefix(n);
    for (int i=0; i<n; i++){
        cin>>a[i];
    }
    prefix[0]=a[0];
    for (int i=1; i<n; i++){
        prefix[i]=prefix[i-1]+a[i];
    }
    unordered_set <long long> b(n);
    for (int i=0; i<n; i++){
        b.insert(prefix[i]);
    }
    long long answer=0;
    for (auto x:prefix){
        if(x==k){
            answer++;
        }
        if (b.count(x-k)==1){
            answer++;
        }
    }
    cout<<answer<<"\n";
}