#include <bits/stdc++.h>
using namespace std;
#define int long long
constexpr int N = 105;
constexpr int inf = 1e18;
int a[N], s[N][N];
set<int> dp[N][N];
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, l, r;
cin >> n >> l >> r;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i <= n; i++) {
long long cur = 0;
for (int j = i; j <= n; j++) {
cur += a[j];
s[i][j] = cur;
}
}
dp[0][0].insert(0);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 0; k < i; k++) {
int sum = s[k + 1][i];
for (auto x : dp[k][j - 1]) {
dp[i][j].insert(x | sum);
}
}
}
}
int ans = inf;
for (int i = l; i <= r; i++) {
ans = min(ans, *dp[n][i].begin());
}
cout << ans << '\n';
return 0;
}
