#include<bits/stdc++.h>
#define LL long long
#define N 2010
using namespace std;
LL sum[N];
int A[N],n,a,b;

int f[110][110];

int h[N];

int main()
{
	
	scanf("%d%d%d",&n,&a,&b);
	for (int i=1;i<=n;++i) scanf("%d",&A[i]),sum[i]=sum[i-1]+A[i];
	

	LL T=0,need=0;
	
	
	for (int bit=40;bit>=0;--bit) {
		T|=1ll<<bit;
		
		
		if (a!=1) 
		{
			memset(f,0,sizeof(f));
			f[0][0]=1;
			for (int i=1;i<=n;++i) {
				for (int j=0;j<i;++j) if ((((sum[i]-sum[j])&T)|need)==need) {
					for (int k=0;k<=min(j,b-1);++k) if (f[j][k]) {
						f[i][k+1]|=f[j][k];
					}
				}
			}
			int ok=0; for (int i=a;i<=b;++i) ok|=f[n][i];
			if (!ok) need|=1ll<<bit;
		}
		else {
			memset(h,0x3f,sizeof(h));
			h[0]=0;
			
			for (int j=0;j<n;++j) if (h[j]<b) {
				for (int i=j+1;i<=n;++i) if ((((sum[i]-sum[j])&T)|need)==need) {
					h[i]=min(h[i],h[j]+1);
				}
			}
	
			if (h[n]>b) need|=1ll<<bit;
		}
		
		
		
	}
	
	
	printf("%lld\n",need);
	return 0;
}