#include <bits/stdc++.h>
using namespace std;

int main() {
	int n,k;
	cin>>n>>k;
	
	vector<int> numbers(n);
	
	for(auto& number: numbers){
		cin>>number;
	}
	
	int answer = 0;
	
	unordered_map<int,int> hashSum;
	
	int currSum = 0;
	
	hashSum[currSum]++;
	
	for(int i=0; i<n; i++){
		
		currSum += numbers[i];
		
		
		if(hashSum.find(currSum - k) != hashSum.end())answer+=hashSum[currSum - k];
		
		hashSum[currSum]++;
	}
	
	cout<<answer<<" ";
	
	return 0;
}