#include<bits/stdc++.h>
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
//01001101 01100001 01101011 01101000 01100001 01100111 01100001 01111001
using namespace std;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()
#define ld double
#define ull unsigned long long
#define ff first
#define ss second
#define fix fixed << setprecision
#define pii pair<int, int>
#define E exit (0)
#define int long long
const int inf = 1e15, N = 5e3 + 1, mod = 998244353;
double eps = 1e-6;
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int n, a, b;
int y[N];
int f(int val) {
int dp[n + 1];
dp[0] = 0;
for (int i = 1; i <= n; i++) {
dp[i] = inf;
int cur = 0;
for (int j = i; j >= 1; j--) {
cur += y[j - 1];
if ((cur & val) == cur) {
dp[i] = min(dp[j - 1] + 1, dp[i]);
}
}
}
return dp[n];
}
main() {
//freopen("F.in", "r", stdin);
//freopen("F.out", "w", stdout);
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
cin >> n >> a >> b;
int mx = 0;
for (int i = 0; i < n; i++) {
cin >> y[i];
mx = max(mx, y[i]);
}
if (n <= 20) {
int ans = inf;
for (int mask = 0; mask < (1 << (n - 1)); mask++) {
int cnt = __builtin_popcount(mask) + 1;
if (a <= cnt && cnt <= b) {
int cur = 0, val = 0;
for (int i = 0; i < n; i++) {
cur += y[i];
if (mask >> i & 1) {
val |= cur;
cur = 0;
}
}
val |= cur;
ans = min(ans, val);
}
}
cout << ans;
}else if (n <= 50 && mx <= 10) {
int dp[n + 1][n + 1][501];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
for (int v = 0; v <= 500; v++) dp[i][j][v] = inf;
}
}
for (int v = 0; v <= 500; v++) dp[0][0][v] = v;
for (int i = 1; i <= n; i++) {
for (int bl = 1; bl <= i; bl++) {
for (int v = 0; v <= 500; v++) {
int cur = 0;
for (int j = i; j >= 1; j--) {
cur += y[j - 1];
dp[i][bl][v] = min(dp[i][bl][v], dp[j - 1][bl - 1][v | cur]);
}
}
}
}
int ans = inf;
for (int i = a; i <= b; i++) ans = min(ans, dp[n][i][0]);
cout << ans;
}else if (a == 1) {
int l = 0, r = mx * n, ans;
while (l <= r) {
int mid = (l + r) / 2;
if (f(mid) <= b) {
l = mid + 1;
ans = mid;
}else r = mid - 1;
}
cout << ans;
}
}
