#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;
}