/// In The Name Of God
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = (int)2000 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
using namespace std;
int n, A, B;
int a[N];
ll ans = linf;
void rec(int v = 1, int done = 0, ll cost = 0) {
if (done > B) return;
if (v > n) {
if (A <= done && done <= B) {
ans = min(ans, cost);
}
if (clock() / (double)CLOCKS_PER_SEC > 0.9) cout << ans, ioi
return;
}
ll sum = 0;
for (int i = v; i <= n; i++) {
sum += a[i];
rec(i + 1, done + 1, cost | sum);
}
}
int main() {
#ifdef IOI2018
freopen ("in.txt", "r", stdin);
#endif
Kazakhstan
cin >> n >> A >> B;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
rec();
cout << ans;
ioi
}
