#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define trav(i,a) for(auto &i : a)
bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}
void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
void usaco(string filename) {
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;
bool dp1[105][105];
ll dp2[2005];
void solve(int test_case)
{
ll n, x, y; cin >> n >> x >> y;
vector<ll> a(n + 5);
rep1(i, n) cin >> a[i];
if (n <= 100) {
ll mask = 0;
for (int bit = 49; bit >= 0; --bit) {
ll f = 1ll << bit;
mask |= f;
memset(dp1, 0, sizeof dp1);
dp1[0][0] = 1;
rep1(i, n) {
rep1(j, n) {
ll sum = 0;
for (int k = i; k >= 1; --k) {
sum += a[k];
if (!(sum & mask)) {
dp1[i][j] |= dp1[k - 1][j - 1];
}
}
}
}
bool flag = false;
for (int j = x; j <= y; ++j) {
if (dp1[n][j]) flag = true;
}
if (!flag) {
mask ^= f;
}
}
ll ans = (1ll << 50) - 1 - mask;
cout << ans << endl;
}
else {
ll mask = 0;
for (int bit = 49; bit >= 0; --bit) {
ll f = 1ll << bit;
mask |= f;
rep(i, n + 5) dp2[i] = inf2;
dp2[0] = 0;
rep1(i, n) {
ll sum = 0;
for (int j = i; j >= 1; --j) {
sum += a[j];
if (!(sum & mask)) {
dp2[i] = min(dp2[i], 1 + dp2[j - 1]);
}
}
}
bool flag = false;
if (dp2[n] <= y) flag = true;
if (!flag) {
mask ^= f;
}
}
ll ans = (1ll << 50) - 1 - mask;
cout << ans << endl;
}
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
