#include "bits/stdc++.h"
using namespace std;
#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, u, b;
cin >> n >> u >> b;
vector<int> a(n + 1);
vector<long long> pref(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
pref[i] = pref[i - 1] + a[i];
}
long long d = 0;
long long ans = 0;
if (u == 1) {
for (int bit = 60; bit >= 0; --bit) {
d |= 1LL << bit;
vector<int> dp(n + 1, b + 1);
dp[0] = 0;
for (int i = 1; i <= n; ++i) {
for (int j = i - 1; j >= 0; --j) {
long long sum = pref[i] - pref[j];
if ((sum & d) == 0) {
dp[i] = min(dp[i], dp[j] + 1);
}
}
}
if (dp[n] > b) {
d ^= 1LL << bit;
ans |= 1LL << bit;
}
}
cout << ans << '\n';
} else {
for (int bit = 60; bit >= 0; --bit) {
d |= 1LL << bit;
vector<vector<int>> dp(n + 1, vector<int> (b + 1));
dp[0][0] = true;
for (int i = 1; i <= n; ++i) {
for (int j = i - 1; j >= 0; --j) {
for (int k = 0; k <= j; ++k) {
long long sum = pref[i] - pref[j];
if (k + 1 <= b && (sum & d) == 0) {
dp[i][k + 1] |= dp[j][k];
}
}
}
}
bool f = false;
for (int i = u; i <= b; ++i) {
f |= dp[n][i];
}
if (!f) {
d ^= 1LL << bit;
ans |= 1LL << bit;
}
}
cout << ans << '\n';
}
return 0;
}
