#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf = INT_MAX;
const int nx = 105;
ll n, a, b, qs[nx];
ll dp[nx][nx];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >> a >> b;
for (int i = 1; i <= n; i++) {
cin >> qs[i];
qs[i] += qs[i - 1];
}
for (int i = 0; i < nx; i++) for (int j = 0; j < nx; j++) dp[i][j] = inf;
dp[0][0] = 0;
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= n; i++) {
if (k == 1) {
dp[i][k] = qs[i];
continue;
}
for (int j = 0; j < i; j++) {
dp[i][k] = min(dp[i][k], dp[j][k - 1] | (qs[i] - qs[j]));
}
}
}
ll ans = inf;
for (int k = a; k <= b; k++) {
ans = min(ans, dp[n][k]);
}
cout << ans;
}
