#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define bug cout << "bug" << endl
#define speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define pll pair <ll, ll>
#define pii pair <int, int>
#define triple pair <pair <ll, ll> , ll>
#define ull unsigned long long
#define ld long double
#define pinode pair <node*, node*>
const ll INF = 9e18 + 5;
const ll inf = 1e9 + 5;
const ll N = 100 + 5;
const ll shift = 2e6;
const ll mod = 998244353;
const ll mod2 = 1e9 + 9;
const ll M = 1e3 + 5;
const ll LOG = 21;
const ll sp = 263;
const ll sp2 = 9973;
const int block = 100;
const double eps = 1e-10;
ll n, a, b, Y[N], dp[N][505][N], pref[N], max_value, ans = INF;
int main(){
speed;
cin >> n >> a >> b;
for(int i = 1; i <= n; i++){
cin >> Y[i];
pref[i] = pref[i - 1] + Y[i];
}
if(n <= 20){
for(ll col = a; col <= b; col++){
for(ll mask = 0; mask < (1 << (n - 1)); mask++){
if(__builtin_popcount(mask) != (col - 1))
continue;
// cout << "FOUND " << mask << endl;
ll last = 0, cur = 0;
for(int i = 0; i < n; i++){
if((1 << i) & mask){
cur = (cur | (pref[i + 1] - pref[last]));
last = i + 1;
}
}
cur = (cur | (pref[n] - pref[last]));
ans = min(ans, cur);
}
}
cout << ans << endl;
return 0;
}
max_value = 10 * n;
for(int i = 0; i <= n; i++){
for(int j = 0; j <= max_value; j++){
for(int z = 0; z <= n; z++){
dp[i][j][z] = 0;
}
}
}
dp[0][0][0] = 1;
for(int i = 1; i <= n; i++){
for(int j = 0; j < i; j++){
for(int curor = 0; curor <= max_value; curor++){
for(int part = 0; part < n; part++){
ll sum = pref[i] - pref[j];
if(!dp[j][curor][part])
continue;
dp[i][(curor | sum)][part + 1] = 1;
}
}
}
}
for(ll curor = 0; curor <= max_value; curor++){
for(int part = a; part <= b; part++){
if(dp[n][curor][part] == 0)
continue;
ans = min(ans, curor);
}
}
cout << ans << endl;
}
