#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n,m,k,x,y,z;
ll mn[2005];
ll a,b,ar[2005];
void exhaust(ll id, ll ttl, ll sum, ll cut) {
if (id > n) {
mn[cut] = min(mn[cut],ttl | sum);
return;
}
exhaust(id+1,ttl,sum+ar[id],cut);
if (id != 1) exhaust(id+1,ttl | sum,ar[id],cut+1);
}
signed main() {
cin >> n >> a >> b;
for (int i = 1; i <= n; i++) mn[i] = LLONG_MAX;
for (int i = 1; i <= n; i++) cin >> ar[i];
exhaust(1,0,0,1);
ll ans = LLONG_MAX;
for (int i = a; i <= b; i++) ans = min(ans,mn[i]);
cout << ans << "\n";
}
