#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define f first
#define s second
#define pb push_back
#define ep emplace
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define uniquev(v) sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define mem(f,x) memset(f , x , sizeof(f))
#define sz(x) (int)(x).size()
#define __lcm(a, b) (1ll * ((a) / __gcd((a), (b))) * (b))
#define mxx *max_element
#define mnn *min_element
#define cntbit(x) __builtin_popcountll(x)
#define len(x) (int)(x.length())
const int N = 1e5 + 10;
int v[N];
ll solve() {
int n, a, b;
cin >> n >> a >> b;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
ll ans = 0, en = 0;
if (n <= 100) {
for (int j = 50; j >= 0; j--) {
en |= ((ll)1 << j);
vector < vector <bool>> dp(n + 1, vector <bool>(b + 1, 0));
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
ll all = 0;
for (int k = i; k >= 1; k--) {
all += v[k];
ll t = all & en;
if ((t & ans) == t) {
for (int f = 1; f <= b; f++) {
dp[i][f] = max(dp[i][f], dp[k - 1][f - 1]);
}
}
}
}
bool is = 0;
for (int i = a; i <= b; i++) {
is |= dp[n][i];
}
if (is == 0) {
ans |= ((ll)1 << j);
}
}
} else {
for (int j = 50; j >= 0; j--) {
en |= ((ll)1 << j);
vector <int> dp(n + 1, 1e9);
dp[0] = 0;
for (int i = 1; i <= n; i++) {
ll all = 0;
for (int k = i; k >= 1; k--) {
all += v[k];
ll t = all & en;
if ((t & ans) == t) {
dp[i] = min(dp[i], dp[k - 1] + 1);
}
}
}
if (dp[n] > b) {
ans |= ((ll)1 << j);
}
}
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << solve() << '\n';
return 0;
}
