#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define pa pair<ll, ll>
#define fi first
#define se second
#define bit(mask, j) ((mask >> j) & 1)
#define t_test int t;cin >> t;while(t--)
const ll mod = 1e9 + 7;
const ll INF = 1e18;
inline void adm(ll &x){if(x>=mod)x%=mod;else if(x<0)x+=mod;}
//--------------------------------------------------------------------
const ll N = 2003;
ll w[N], s[N];
ll get_sum(ll i, ll j) {
return s[j] - s[i - 1];
}
ll n, a, b;
namespace sub3 {
const ll N = 103;
ll dp[N][N];
void slove() {
ll LG = __lg(s[n]);
ll mask = 0;
FORD(j, LG, 0) {
memset(dp, 0, sizeof dp);
dp[0][0] = 1;
FOR(i, 1, n) {
FOR(y, 1, b) {
FOR(u, 0, i - 1) {
if(dp[u][y - 1] == 1) {
ll x = mask | get_sum(u + 1, i);
bool ok = true;
FORD(v, LG, j) {
if(bit(mask, v) != bit(x, v)) {
ok = false;
break;
}
}
if(ok) {
dp[i][y] = 1;
}
}
}
}
}
bool ok = false;
FOR(y, a, b) {
if(dp[n][y]) {
ok = true;
break;
}
}
if(!ok) mask ^= (1LL << j);
}
cout << mask;
}
}
namespace sub4 {
ll dp[N];
void slove() {
ll LG = __lg(s[n]);
ll mask = 0;
FORD(j, LG, 0) {
memset(dp, 0x3f, sizeof dp);
dp[0] = 0;
FOR(i, 1, n) {
FOR(u, 0, i - 1) {
ll x = mask | get_sum(u + 1, i);
bool ok = true;
FORD(v, LG, j) {
if(bit(mask, v) != bit(x, v)) {
ok = false;
break;
}
}
if(ok) {
dp[i] = min(dp[i], dp[u] + 1);
}
}
}
bool ok = false;
if(dp[n] <= b) ok = true;
if(!ok) mask ^= (1LL << j);
}
cout << mask;
}
}
void hbmt() {
cin >> n >> a >> b;
FOR(i, 1, n) {
cin >> w[i];
s[i] = s[i - 1] + w[i];
}
if(n <= 100) return sub3::slove();
sub4::slove();
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
if(fopen("hbmt.inp", "r")) {
freopen("hbmt.inp", "r", stdin);
freopen("hbmt.out", "w", stdout);
}
// t_test
hbmt();
return 0;
}
