#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ld long double
#define ll long long int
#define eliminate(x, y) (x).erase(remove(all(x), (y)), (x).end())
#define make_unique(x) sort(all(x)), (x).erase(unique(all(x)), (x).end());
#define all_range(x) (x).begin(), (x).begin()
#define All(x) (x).rbegin(), (x).rend()
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size()
#define newl cerr << '\n'
#define endl '\n'
using namespace std;
template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T>void prd(const T& x);
template<typename T, typename U>void prd(const pair<T, U>& x);
template<typename T, typename... A>void prd(const T& x, A... a);
template<typename... A>void debug(A... a);
template<typename T>void debug(const set<T>& c);
template<typename T>void debug(const vector<T>& c);
template<typename T>void debug(const vector<vector<T>> &c);
template<typename K, typename V>void debug(const map<K, V>& c);
void fail() {debug("DONE"); exit(0);}
const int MOD = 1e9 + 7;
const int mod = 998244353;
const int INF = 2e9 + 7;
const ll INFL = 2e18 + 7;
const double EPS = 1e-9;
void FastIO();
struct Trie {
int N, cur = 1;
const int LOG = 31;
vector<array<int, 2>> trie;
vector<int> mn;
Trie(int n) : N(n + 1), trie(LOG * N), mn(LOG * N, INF) {
insert(0, 0);
}
void insert(int x, int j) {
for(int i = LOG, k = 1, b; i >= 0; i--){
b = (x >> i) & 1;
if(!trie[k][b])
trie[k][b] = ++cur;
k = trie[k][b];
mn[k] = min(mn[k], j);
}
}
int mn_great(int x, int y) {
int ans = INF;
for(int i = LOG, k = 1; i >= 0 && k; i--){
int xb = (x >> i) & 1;
int yb = (y >> i) & 1;
if(!yb){
ans = min(ans, mn[trie[k][xb ^ 1]]);
k = trie[k][xb];
} else {
k = trie[k][xb ^ 1];
}
}
return ans;
}
};
int main(){
FastIO();
int n, k; cin >> n >> k, k--;
vector<int> A(n);
Trie trie(n);
int x = -1, y = -1;
for(int j = 0; j < n; j++){
cin >> A[j];
if(j) A[j] ^= A[j - 1];
int i = trie.mn_great(A[j], k);
trie.insert(A[j], j+1);
if(i == INF) continue;
if(j - i == y - x && i < x)
x = i, y = j;
else if(j - i > y - x)
x = i, y = j;
}
x++, y++;
assert(x > 0 && y > 0);
// debug(x, y);
cout << x << ' ' << y - x + 1 << endl;
return 0;
}
void FastIO(){ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
template<typename T> void prd(const T& x){cerr<<x;}
template<typename T, typename U>void prd(const pair<T, U>& x){cerr<<"(";prd(x.fi);cerr<<", ";prd(x.se);cerr<<")";}
template<typename T, typename... A>void prd(const T& x, A... a){prd(x);cerr<<", ";prd(a...);}
template<typename... A> void debug(A... a){cerr << "["; prd(a...);cerr<<"]\n";}
template<typename T> void debug(const set<T>& c){cerr<<'[';bool cm=0;for(const auto& st:c){if(cm)cerr<<", ";prd(st);cm=1;}cerr<<"]\n";}
template<typename T> void debug(const vector<T>& c){cerr<<'[';bool cm=0;for(const auto& v:c){if(cm)cerr<<", ";prd(v);cm=1;}cerr<<"]\n";}
template<typename T> void debug(const vector<vector<T>> &c){for(const auto &v: c)debug(v);cerr<<'\n';}
template<typename K, typename V> void debug(const map<K, V>& c){cerr<<'[';bool cm=0;for(auto[k, v]:c){if(cm)cerr<<", ";cerr<<'[';prd(k);cerr <<", ";prd(v);cerr<<']';cm = 1;}cerr<<"]\n";}
/*
4 6
6 1 2 4
*/
