#include <bits/stdc++.h>
using namespace std;
const int mxN = 950005;
#define int long long
const int INF = 5e18;
int seg[mxN * 4], a[mxN];
void upd(int node, int start, int end, int idx, int v){
if(start == end){
seg[node] = v;
return;
}
int mid = start + (end - start) / 2;
if(idx <= mid){
upd(node * 2 + 1, start, mid, idx, v);
}else{
upd(node * 2 + 2, mid + 1, end, idx, v);
}
seg[node] = min(seg[node * 2 + 1], seg[node * 2 + 2]);
}
int query(int node, int start, int end, int l, int r){
if(start > r || end < l) return INF;
if(start >= l && end <= r) return seg[node];
int mid = start + (end - start) / 2;
return min(query(node * 2 + 1, start, mid, l, r),
query(node * 2 + 2, mid + 1, end, l, r));
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
int n, x;
cin >> n >> x;
vector<int> pref(n + 1, 0);
for(int i = 1; i <= n; ++i){
cin >> a[i];
pref[i] = pref[i - 1] ^ a[i];
}
pair<int, int> ans = {0, 0};
for(int i = 1; i <= n; ++i){
for(int j = i; j >= 1; --j){
if(pref[i] >= (pref[j - 1] ^ x)){
if(ans.first == (i - j + 1)) ans = min(ans, {i - j + 1, j});
else ans = max(ans, {i - j + 1, j});
}
}
}
cout << ans.second << " " << ans.first << "\n";
return 0;
}
