#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, a, b, ans=0;
cin>>n>>a>>b;
vector<int> psum(n+1, 0);
for (int i=1; i<=n; ++i)cin>>psum[i], psum[i]+=psum[i-1];
if (a==1){
for (int k=60; k>=0; --k){
vector<int> dp(n+1, LLONG_MAX/2);
dp[0]=0;
ans|=(1ll<<k);
for (int i=1; i<=n; ++i)for (int j=0; j<i; ++j)if (!((psum[i]-psum[j])&ans))dp[i]=min(dp[i], dp[j]+1);
if (dp[n]>b)ans^=(1ll<<k);
}
}
else{
for (int k=60; k>=0; --k){
vector<vector<int> > dp(n+1, vector<int>(n+1, 0));
dp[0][0]=1;
ans|=(1ll<<k);
for (int i=1; i<=n; ++i)for (int j=1; j<=i; ++j)for (int p=0; p<i; ++p)if (!((psum[i]-psum[p])&ans))dp[i][j]|=dp[p][j-1];
int can=0;
for (int i=a; i<=b; ++i)can|=dp[n][i];
if (!can)ans^=(1ll<<k);
}
}
ans^=((1ll<<61)-1);
cout<<ans;
}
