#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 250005;
int n, ans;
ll a[N], pre[N], x;
void inp()
{
cin >> n >> x;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
pre[i] = pre[i-1] ^ a[i];
}
}
int check (int k)
{
for (int i = 1; i + k - 1 <= n; i++)
{
ll res = pre[i + k - 1] ^ pre[i-1];
if (res >= x)
return i;
}
return 0;
}
void solve()
{
int l = 1, r = n;
while (l <= r)
{
int mid = (l + r) / 2;
if (check(mid))
{
ans = mid;
l = mid + 1;
}
else
r = mid - 1;
}
cout << check(ans) << " " << ans;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
inp();
solve();
}
