#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/rope>
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef long double ld;
template <class T>
using VV = vector<vector<T>>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<long long>;
using VVL = vector<vector<long long>>;
using VC = vector<char>;
using VVC = vector<vector<char>>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using VD = vector<double>;
using VVD = vector<vector<double>>;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
using PIL = pair<int, long long>;
using PLI = pair<long long, int>;
using VPII = vector<pair<int, int>>;
using VPLL = vector<pair<long long, long long>>;
#define LINE '\n'
#define SPACE ' '
#define PB push_back
#define FOR(i, a, b) for (int i = (a); i < (int(b)); i++)
#define FORE(i, a, b) for (int i = (a); i <= (int)((b)); i++)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define sq(a) ((a) * (a))
#define sz(x) ((int)x.size())
#define fastio() \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr)
#define debug(x) cerr << #x << " = " << x << endl;
const ll MOD = 1e9 + 7;
template <class T>
inline void maxi(T &a, T b)
{
a = max(a, b);
}
template <class T>
inline void mini(T &a, T b)
{
a = min(a, b);
}
template <class T>
inline void addi(T &a, T b)
{
a = (a + b) % MOD;
}
template <class T>
inline void subi(T &a, T b)
{
a = (a - b + MOD) % MOD;
}
template <class T>
inline T add(T a, T b)
{
return (a + b) % MOD;
}
template <class T>
inline T sub(T a, T b)
{
return (a - b + MOD) % MOD;
}
template <class T>
inline T mul(T a, T b)
{
return ((a % MOD) * (b % MOD)) % MOD;
}
constexpr ll binpow(ll a, ll b, ll mod)
{
ll res = 1;
while (b > 0)
{
if (b & 1)
{
res = (res * a) % mod;
}
a = (a * a) % mod;
b >>= 1;
}
return res;
}
const int INF = 1e9 + 5;
static const int MAX_N = 250'000;
struct Trie
{
const static int MAX_W = MAX_N * 31 + 1;
array<array<int, 2>, MAX_W> next;
array<int, MAX_W> time;
int triesz = 0;
Trie()
{
FOR(i, 0, MAX_W)
next[i].fill(-1);
fill(ALL(time), INF);
}
void add(int x, int t)
{
int node = 0;
mini(time[node], t);
for (int i = 30; i >= 0; i--)
{
int bit = (x & (1u << i)) != 0;
int v = next[node][bit];
if (v == -1)
{
v = ++triesz;
}
next[node][bit] = v;
node = v;
mini(time[node], t);
}
}
int find(int x, int k)
{
int ret = INF;
int node = 0;
for (int i = 30; i >= 0; i--)
{
int bit_x = (x & (1u << i)) != 0;
int bit_k = (k & (1u << i)) != 0;
if (bit_k == 1)
{
int v = next[node][bit_x ^ 1];
if (v == -1)
return ret;
node = v;
}
else
{
int other = next[node][bit_x ^ 1];
if (other != -1)
mini(ret, time[other]);
int v = next[node][bit_x];
if (v == -1)
return ret;
node = v;
}
}
ret = min(ret, time[node]);
return ret;
}
};
Trie trie;
void solve()
{
int n, k;
cin >> n >> k;
// len, at i
PII ans{0, 0};
int s = 0;
trie.add(0, 0);
FOR(i, 0, n)
{
int a;
cin >> a;
s ^= a;
trie.add(s, i + 1);
int ret = trie.find(s, k);
if (ret != INF)
{
int L = i - ret + 1;
maxi(ans, {L, i + 1});
}
}
assert(ans.second != 0);
cout << ans.second - ans.first + 1 << " " << ans.first << LINE;
}
int main()
{
fastio();
int t = 1;
// cin >> t;
while (t--)
solve();
}
