#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 largest = INT_MIN, smallest = INT_MAX;
for(int i=0; i<n; i++){
int xorSum = 0;
for(int j=i; j<n; j++){
xorSum ^= numbers[j];
if(xorSum == k){
int length = j - i + 1;
largest = max(largest,length);
smallest = min(smallest,length);
}
}
}
cout<<largest<<" "<<smallest<<endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCQoJaW50IG4sazsKCWNpbj4+bj4+azsKCQoJdmVjdG9yPGludD4gbnVtYmVycyhuKTsKCQoJZm9yKGF1dG8mIG51bWJlcjogbnVtYmVycyl7CgkJY2luPj5udW1iZXI7Cgl9CgkKCWludCBsYXJnZXN0ID0gSU5UX01JTiwgc21hbGxlc3QgPSBJTlRfTUFYOwoJCglmb3IoaW50IGk9MDsgaTxuOyBpKyspewoJCWludCB4b3JTdW0gPSAwOwoJCQoJCWZvcihpbnQgaj1pOyBqPG47IGorKyl7CgkJCXhvclN1bSBePSBudW1iZXJzW2pdOwoJCQkKCQkJaWYoeG9yU3VtID09IGspewoJCQkJaW50IGxlbmd0aCA9IGogLSBpICsgMTsKCQkJCQoJCQkJCgkJCQlsYXJnZXN0ID0gbWF4KGxhcmdlc3QsbGVuZ3RoKTsKCQkJCXNtYWxsZXN0ID0gbWluKHNtYWxsZXN0LGxlbmd0aCk7CgkJCQkKCQkJfQoJCQkKCQkJCgkJfQoJfQoJCgljb3V0PDxsYXJnZXN0PDwiICI8PHNtYWxsZXN0PDxlbmRsOwoJCglyZXR1cm4gMDsKfQ==