#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 smallest = INT_MAX, largest = INT_MIN;
int countSmallest = 0, countLargest = 0;
for(int i=0; i<n; i++){
int sum = 0;
for(int j=i; j<n; j++){
sum += numbers[j];
if(sum == k){
int length = j - i + 1;
if(length == largest)countLargest++;
if(length == smallest)countSmallest++;
if(length > largest){
largest = length;
countLargest = 1;
}
if(length < smallest){
smallest = length;
countSmallest = 1;
}
}
}
}
cout<<largest<<" "<<countLargest<<endl;
cout<<smallest<<" "<<countSmallest;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuLGs7CgljaW4+Pm4+Pms7CgkKCXZlY3RvcjxpbnQ+IG51bWJlcnMobik7CgkKCWZvcihhdXRvJiBudW1iZXI6IG51bWJlcnMpewoJCWNpbj4+bnVtYmVyOwoJfQoJCglpbnQgc21hbGxlc3QgPSBJTlRfTUFYLCBsYXJnZXN0ID0gSU5UX01JTjsKCWludCBjb3VudFNtYWxsZXN0ID0gMCwgY291bnRMYXJnZXN0ID0gMDsKCQoJZm9yKGludCBpPTA7IGk8bjsgaSsrKXsKCQlpbnQgc3VtID0gMDsKCQkKCQlmb3IoaW50IGo9aTsgajxuOyBqKyspewoJCQlzdW0gKz0gbnVtYmVyc1tqXTsKCQkJCgkJCWlmKHN1bSA9PSBrKXsKCQkJCWludCBsZW5ndGggPSBqIC0gaSArIDE7CgkJCQkKCQkJCWlmKGxlbmd0aCA9PSBsYXJnZXN0KWNvdW50TGFyZ2VzdCsrOwoJCQkJaWYobGVuZ3RoID09IHNtYWxsZXN0KWNvdW50U21hbGxlc3QrKzsKCQkJCQoJCQkJaWYobGVuZ3RoID4gbGFyZ2VzdCl7CgkJCQkJbGFyZ2VzdCA9IGxlbmd0aDsKCQkJCQljb3VudExhcmdlc3QgPSAxOwoJCQkJfQoJCQkJCgkJCQlpZihsZW5ndGggPCBzbWFsbGVzdCl7CgkJCQkJc21hbGxlc3QgPSBsZW5ndGg7CgkJCQkJY291bnRTbWFsbGVzdCA9IDE7CgkJCQl9CgkJCQkKCQkJCQoJCQl9CgkJfQoJfQoJCgljb3V0PDxsYXJnZXN0PDwiICI8PGNvdW50TGFyZ2VzdDw8ZW5kbDsKCWNvdXQ8PHNtYWxsZXN0PDwiICI8PGNvdW50U21hbGxlc3Q7CgkKCXJldHVybiAwOwp9