#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=LLONG_MAX;
	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(len<length) {
				length=len;
				ans=1;
			}
			else if(len==length) ans++;
		}
		mp[sum]=i;
	}
 
	cout<<ans<<endl;
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnVzaW5nIGxsID1sb25nIGxvbmc7CgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWxsIG4sazsKCWNpbj4+bj4+azsKCXZlY3RvcjxsbD5hcnIobik7Cglmb3IobGwgaT0wO2k8bjtpKyspIGNpbj4+YXJyW2ldOwoJbGwgc3VtPTA7Cgl1bm9yZGVyZWRfbWFwPGxsLGxsPm1wOwoJbXBbMF09LTE7CgoJbGwgbGVuZ3RoPUxMT05HX01BWDsKCWxsIGFucz0wOwoJZm9yKGxsIGk9MDtpPG47aSsrKXsKCQlzdW0rPWFycltpXTsKCQlpZihtcC5jb3VudChzdW0taykpewoJCQlsbCBsZW49aS1tcFtzdW0ta107CgkJCWNvdXQ8PGxlbjw8ZW5kbDsKCQkJaWYobGVuPGxlbmd0aCkgewoJCQkJbGVuZ3RoPWxlbjsKCQkJCWFucz0xOwoJCQl9CgkJCWVsc2UgaWYobGVuPT1sZW5ndGgpIGFucysrOwoJCX0KCQltcFtzdW1dPWk7Cgl9CgkKCWNvdXQ8PGFuczw8ZW5kbDsKCXJldHVybiAwOwp9

OCAxNQoxMCA1IDIgNyAxIDkgOCA3

8 15
10 5 2 7 1 9 8 7