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

int main() {
	// your code goes here
	ll n,k;
	cin>>n>>k;
	vector<ll>arr(n);
	for(ll i=0;i<n;i++) cin>>arr[i];
	ll sum=0;
	unordered_map<ll,ll>mp;
	mp[0]=-1;

	ll length=0;
	ll ans=0;
	for(ll i=0;i<n;i++){
		sum+=arr[i];
		if(mp.count(sum-k)){
			ll len=i-mp[sum-k];
			cout<<len<<endl;
			if(length<len) {
				length=len;
				ans=1;
			}
			else if(len==length) ans++;
		}
		if(!mp.count(sum))
		mp[sum]=i;
	}
	
	cout<<ans<<endl;
	return 0;
}