#include <bits/stdc++.h>
using namespace std;
const int mxN = 550005;
#define int long long
int a[mxN];
struct Node {
Node* children[2];
int mn_idx;
Node() {
children[0] = children[1] = NULL;
mn_idx = mxN;
}
};
struct Trie {
Node* root = new Node();
void add(int val, int idx) {
Node* curr = root;
for (int i = 32; i >= 0; --i) {
int curr_bit = (val >> i) & 1;
if (curr->children[curr_bit] == NULL)
curr->children[curr_bit] = new Node();
curr = curr->children[curr_bit];
curr->mn_idx = min(curr->mn_idx, idx);
}
}
int query(int val, int idx) {
Node* curr = root;
int ans = 0;
for (int i = 32; i >= 0; --i) {
int curr_bit = (val >> i) & 1;
if (curr->children[1 - curr_bit] != NULL &&
curr->children[1 - curr_bit]->mn_idx <= idx) {
ans |= 1LL << i;
curr = curr->children[1 - curr_bit];
} else if (curr->children[curr_bit] != NULL &&
curr->children[curr_bit]->mn_idx <= idx) {
curr = curr->children[curr_bit];
} else {
break;
}
}
return ans;
}
} tr;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
int n, x, pref = 0;
cin >> n >> x;
pair<int, int> ans = {0, 0};
for (int i = 1; i <= n; ++i) {
cin >> a[i];
tr.add(pref, i);
pref ^= a[i];
int st = 1, en = i, best = -1;
while (st <= en) {
int mid = (st + en) / 2;
if (tr.query(pref, mid) >= x) {
best = i - mid + 1;
st = mid + 1;
} else {
en = mid - 1;
}
}
if (best != -1) {
if (ans.first < best) {
ans = {best, i - best + 1};
}
}
}
cout << ans.second << " " << ans.first << "\n";
return 0;
}
