#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#define ll long long
// #define ld long int
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;
const ll INF = 1e12;
const ll N =(2005); // TODO : change value as per problem
const ll MOD = 1e9+7;
int n,a,b;
int y[N];
int ans;
int dp[N];
bool can(){
for(int i = 0;i<=n;i++){
dp[i] = INF;
}
dp[0] = 0;
for(int i =0;i<n;i++){
int sum = 0;
for(int j =i;j<n;j++){
sum += y[j];
if((ans | sum) == ans)
dp[j+1] = min(dp[j+1],dp[i]+1);
}
}
// cout << dp[n] << endl;
if(dp[n] <= b) return true;
else return false;
}
void solve(){
cin >> n >> a >> b;
for(int i =1;i<=n;i++)
cin >> y[i-1];
ans = (1ll<<57)-1;
for(int i = 56;i>=0;i--){
ans ^= (1ll<<i);
bool x = can();
if(x == false){
ans |= (1ll<<i);
}
}
cout << ans << endl;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
// freopen(".in","r",stdin);freopen(".out","w",stdout);
ll tt=1;
// cin >> tt;
while(tt--){
solve();
}
}
