#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<endl
#define dout(a) cout<<a<<' '<<#a<<endl
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
int n,A,B;
vi v;
struct edge{
int to, w, active;
};
signed main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
//ifstream cin(".in");
//ofstream cout(".out");
cin>>n>>A>>B; v.resize(n); f0r(i,n)cin>>v[i];
vi ps(n + 1);
FOR(i,1,n+1)ps[i] = ps[i-1] + v[i-1];
if(A == 1){
vector<vector<edge>> adj(n + 1);
f0r(i,n){
FOR(j, i + 1, n+1){
int sum = ps[j] - ps[i];
adj[i].pb({j, sum, 1});
}
}
vi dist(n+1, 4e18);
vb ans(41);
queue<int>q;
for(int b = 40; b>=0; b--){
f0r(i,n){
for(auto &u : adj[i]){
if(u.w & (1LL << b)){
if(u.active == 1){
u.active = 2;
}
}
}
}
f0r(j, n+1)dist[j] = 4e18;
dist[0] = 0;
q.push(0);
while(!q.empty()){
int node = q.front(); q.pop();
for(auto u : adj[node]){
if(dist[u.to] == 4e18 && u.active == 1){
q.push(u.to); dist[u.to] = dist[node] + 1;
}
}
}
// vout(dist);
if(dist[n] <= B){
ans[b] = 0;
f0r(i,n){
for(auto &u : adj[i]){
if(u.active == 2){
u.active = 0;
}
}
}
}
else{
ans[b] = 1;
f0r(i,n){
for(auto &u : adj[i]){
if(u.active == 2){
u.active = 1;
}
}
}
}
}
int ret = 0;
f0r(i, 41){
ret += (1LL << i) * ans[i];
}
out(ret);
}
else{
vector<vector<edge>> adj(n + 1);
f0r(i,n){
FOR(j, i + 1, n+1){
int sum = ps[j] - ps[i];
adj[i].pb({j, sum, 1});
}
}
vvi dist(n+1, vi(n+1, 0));
vb ans(41);
for(int b = 40; b>=0; b--){
f0r(i,n){
for(auto &u : adj[i]){
if(u.w & (1LL << b)){
if(u.active == 1){
u.active = 2;
}
}
}
}
f0r(i, n+1)f0r(j, n+1)dist[i][j] = 0;
dist[0][0] = 1;
f0r(it, n+1){
f0r(i, n){
for(auto &u : adj[i]){
if(u.active == 1){
f0r(j, n){
if(dist[i][j])dist[u.to][j + 1] = 1;
}
}
}
}
}
bool ok = 0;
FOR(i, A, B+1){
if(dist[n][i])ok = 1;
}
if(ok){
ans[b] = 0;
f0r(i,n){
for(auto &u : adj[i]){
if(u.active == 2){
u.active = 0;
}
}
}
}
else{
ans[b] = 1;
f0r(i,n){
for(auto &u : adj[i]){
if(u.active == 2){
u.active = 1;
}
}
}
}
}
int ret = 0;
f0r(i, 41){
ret += (1LL << i) * ans[i];
}
out(ret);
}
}
