#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;
 
	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)largest = length;
				if(length < smallest) smallest = length;
			}
		}
	}
 
	cout<<largest<<" "<<smallest;
 
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuLGs7CgljaW4+Pm4+Pms7CgkKCXZlY3RvcjxpbnQ+IG51bWJlcnMobik7CgkKCWZvcihhdXRvJiBudW1iZXI6IG51bWJlcnMpewoJCWNpbj4+bnVtYmVyOwoJfQoJCglpbnQgc21hbGxlc3QgPSBJTlRfTUFYLCBsYXJnZXN0ID0gSU5UX01JTjsKCQoJZm9yKGludCBpPTA7IGk8bjsgaSsrKXsKCQlpbnQgc3VtID0gMDsKCQkKCQlmb3IoaW50IGo9aTsgajxuOyBqKyspewoJCQlzdW0gKz0gbnVtYmVyc1tqXTsKCQkJCgkJCWlmKHN1bSA9PSBrKXsKCQkJCWludCBsZW5ndGggPSBqIC0gaSArIDE7CgkJCQkKCQkJCWlmKGxlbmd0aCA+IGxhcmdlc3QpbGFyZ2VzdCA9IGxlbmd0aDsKCQkJCWlmKGxlbmd0aCA8IHNtYWxsZXN0KSBzbWFsbGVzdCA9IGxlbmd0aDsKCQkJfQoJCX0KCX0KCQoJY291dDw8bGFyZ2VzdDw8IiAiPDxzbWFsbGVzdDsKCQoJcmV0dXJuIDA7Cn0=

NSA0CjMgMSAzIC0yIDI=

5 4
3 1 3 -2 2