#include <bits/stdc++.h>
#define int long long
#define debug cout << "ok\n";
#define SQR(x) (1LL * ((x) * (x)))
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pli pair<ll,int>
#define vi vector<int>
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int ui;
using namespace std;
const int M = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFLL = (ll)2e18 + 7LL;
const ld PI = acos(-1);
const int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};
template<class _, class __>
bool minimize(_ &x, const __ y){
if(x > y){
x = y;
return true;
} else return false;
}
template<class _, class __>
bool maximize(_ &x, const __ y){
if(x < y){
x = y;
return true;
} else return false;
}
template<class _,class __>
void Add(_ &x, const __ y) {
x += y;
if (x >= M) {
x -= M;
}
return;
}
template<class _,class __>
void Diff(_ &x, const __ y) {
x -= y;
if (x < 0) {
x += M;
}
return;
}
//--------------------------------------------------------------
const int MaxN = 2007;
int n,A,B,a[MaxN];
namespace sub1 {
bool check() {
return A != 1;
}
bool f[2007][2007];
bool check_mask(int mask) {
for (int i=0;i<=n;i++) for (int j=0;j<=B;j++) f[i][j] = false;
f[0][0] = true;
for (int i=1;i<=n;i++) {
for (int j=0;j<i;j++) {
if (((a[i] - a[j]) | mask) != mask) continue;
for (int k=0;k<=j;k++) {
f[i][k+1] |= f[j][k];
}
}
}
for (int i=A;i<=B;i++) if (f[n][i]) return true;
return false;
}
void sol() {
int res = MASK(50) - 1;
for (int i=49;i>=0;i--) {
if (check_mask(res^MASK(i))) {
res ^= MASK(i);
}
}
cout << res;
}
}
namespace sub2 {
bool check() {
return true;
}
int f[2007];
bool check_mask(int mask) {
for (int i=1;i<=n;i++) f[i] = INF;
f[0] = 0;
for (int i=1;i<=n;i++) {
for (int j=0;j<i;j++) {
if (((a[i] - a[j]) | mask) != mask) continue;
minimize(f[i],f[j] + 1);
}
}
return f[n] <= B;
}
void sol() {
int res = MASK(50) - 1;
for (int i=49;i>=0;i--) {
if (check_mask(res^MASK(i))) {
res ^= MASK(i);
}
}
cout << res;
}
}
void sol() {
cin >> n >> A >> B;
for (int i=1;i<=n;i++) cin >> a[i];
for (int i=1;i<=n;i++) a[i] += a[i-1];
if (sub1::check()) {
sub1::sol();
return;
}
if (sub2::check()) {
sub2::sol();
return;
}
}
signed main() {
// freopen("test.inp","r",stdin);
// freopen("test.out","w",stdout);
FAST
int t=1;
// cin >> t;
while (t--) sol();
}
