#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 = 50;
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) {
	bd -= (1ll<<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);
			if (!is_submask(suff(va,bt),suff(bd,bt))) continue;
			dp[j] = min(dp[j], dp[i]+1);
		}
	}

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

int dp1[mxn][mxn];

void process1(int bt) {
	bd -= (1ll<<bt);
	memset(dp1, 0, sizeof(dp1));
	dp1[0][0] = 1;
	for (int i=0; i<n; i++) {
		for (int j=0; j<n; j++) {
			if (!dp1[i][j]) continue;
			for (int k=i+1; k<=n; k++) {
				int va = rsq(i+1,k);
				if (!is_submask(suff(va,bt),suff(bd,bt))) continue;
				dp1[k][j+1] = 1;
			}
		}
	}
	for (int i=a; i<=b; i++) {
		if (dp1[n][i]) {
			return;
		}
	}
	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--) {
		if (a == 1) process(m);
		else process1(m);
	}
	printf("%lld",bd);
	
	
	return 0;
}