#include <bits/stdc++.h>
using namespace std;
const int N = (int) 103;
const long long inf = (long long) 4e18;
int n, a, b, y[N];
long long dp[N][N][N];
long long sol0(int i, long long run, int stage, long long sum = 0) {
if (i == n) {
if (a <= stage && stage <= b) {
return run | sum;
}
return inf;
}
long long ret; //dp[i][stage][run];
//if (ret != -1) {
//return ret;
//}
sum += y[i];
ret = sol0(i + 1, run, stage, sum);
if (stage + 1 <= b && i + 1 < n) {
ret = min(ret, sol0(i + 1, run | sum, stage + 1));
}
return ret;
}
long long sol(int i, int j, int stage, long long sum = 0) {
if (i == n) {
if (a <= stage && stage <= b) {
return sum;
}
return inf;
}
long long& ret = dp[i][j][stage];
if (ret != -1) {
return ret;
}
sum += y[i];
ret = sol(i + 1, j, stage, sum);
if (stage + 1 <= b && i + 1 < n) {
ret = min(ret, sum | sol(i + 1, i + 1, stage + 1));
}
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
cin >> y[i];
}
memset(dp, -1, sizeof dp);
if (n <= 20) {
cout << sol0(0, 0, 1) << '\n';
} else {
cout << sol(0, 0, 1) << '\n';
}
return 0;
}
