#include <bits/stdc++.h>
using namespace std;
#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, l, r) for(int i=l; i<r; i++)
#define frange(i, l) forr(i, 0, l)
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef long long lli;
typedef vector<vi> vvi;
typedef vector<lli> vll;
typedef vector<bool> vb;
typedef set<int> seti;
typedef multiset<int> mseti;
void usaco()
{
freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
}
// int dp[101][2049] = {int(1e9)};
int main() {
// usaco();
int n, a, b;
scd(n);
scd(a);
scd(b);
vll vec(n+1);
forr(i, 1, n+1) sclld(vec[i]);
vector<vll> val(n+1, vll(b+1));
for(int i=45; i>=0; i--) {
// dp = vector<vll>(n+1, vll(b+1, 1e18 - 1));
vector<vb> dp(n+1, vb(b+1));
dp[0][0] = true;
forr(j, 0, n) {
forr(k, 0, b) {
if(dp[j][k]) {
lli tot = 0;
for(int l=j+1; l<=n; l++) {
tot += vec[l];
lli v = (val[j][k] | tot);
v = v >> i;
v = v << i;
if((v ^ val[l][k+1]) == 0 && (tot & (1LL<<i)) == 0) dp[l][k+1] = true;
}
}
}
}
forr(j, 1, n+1) {
forr(k, 1, b+1) {
if(!dp[j][k]) {
// printf("%d %d %d\n", i, j, k);
val[j][k] = (val[j][k] | (1LL<<i));
}
}
}
}
// forr(i, 1, n+1) {
// forr(j, 1, b+1) printf("%lld ", dp[i][j]);
// printf("\n");
// }
lli mi = 1e15;
forr(i, a, b+1) mi = min(mi, val[n][i]);
printf("%lld", mi);
}
