#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define i64 long long

const int mxn = 2e3+1;

int n,a,b;
i64 arr[mxn];

i64 rsq(int l, int r) {
	return (l ? arr[r] - arr[l-1] : arr[r]);
}

const int lg = 6;
i64 bd = (1ll<<(lg+1))-1;
int dp[mxn];

i64 suff(int n, int i) {
	return ((n>>i)<<i);
}

int is_submask(i64 a, i64 m) {
	return ((a&m) == a);
}

void process(int bt) {
//	printf("%d, %lld-----\n",bt,bd);
	bd -= (1ll<<bt);
//	printf("%d\n",suff(bd,bt));

	memset(dp,0x3f,sizeof(dp));
	dp[0] = 0;
	for (int i=0; i<n; i++) {
		for (int j=i+1; j<=n; j++) {
			int va = rsq(i+1,j);
//			printf("%d %d  ..  ",va,suff(va,bt));
			if (!is_submask(suff(va,bt),suff(bd,bt))) continue;
			dp[j] = min(dp[j], dp[i]+1);
		}
//		printf("\n");
	}
//	for (int i=1; i<=n; i++) {
//		printf("%d ", dp[i]);
//	}
//	printf("\n\n");

	if (dp[n] > b) {
		bd += (1ll<<bt);
	}
}

signed main() {
	
	scanf("%d%d%d",&n,&a,&b);
	for (int i=1; i<=n; i++) {
		scanf("%lld",&arr[i]);
		arr[i] += arr[i-1];
	}
	for (int m=lg; m>=0; m--) {
		process(m);
	}
	printf("%lld",bd);
	
	
	return 0;
}