#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#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()

const int mxn = 101;
const int inf = 1061109567;

int n,a,b,ag[mxn],dp[mxn][mxn][mxn];

int rsq(int l, int r) {
	if (l) return ag[r]-ag[l-1];
	return ag[r];
}

signed main() {
	
	scanf("%d%d%d",&n,&a,&b);
	for (int i=0; i<n; i++) {
		scanf("%d",&ag[i]);
		if (i) ag[i] += ag[i-1];
	}
	
	memset(dp,0x3f,sizeof(dp));
	
	for (int l=0; l<n; l++) {
		for (int r=l; r<n; r++) {
			dp[l][r][1] = rsq(l,r);
		}
	}
	
	for (int l=n-1; l>=0; l--) {
		for (int r=l; r<n; r++) {
			for (int i=1; i<=n; i++) {
				if (dp[l][r][i] == inf) continue;
				for (int rp=r+1; rp<n; rp++) {
					dp[l][rp][i+1] = min(dp[l][rp][i+1], dp[l][r][i] | rsq(r+1,rp));
				}
			}
		}
	}
	
	printf("%d",dp[0][n-1][b]);
	
	return 0;
}