#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) (int)a.size()
const int N = 100, K = 2200;
int p[N];
int sum(int l, int r) {
return p[r] - (l ? p[l - 1] : 0);
}
//dp[index][OR][number of subarrays] = 1 if possible to obtain such partition
int dp[N][K][N];
void solve() {
int n, A, B;
cin >> n >> A >> B;
vector<int> a(n);
for(int i = 0;i < n; ++i) {
cin >> a[i];
p[i] = (i ? p[i - 1] : 0) + a[i];
}
dp[0][0][0] = 1;
for(int i = 1; i <= n; ++i) {
for(int j = 0;j < i; ++j) {
for(int OR = 0; OR < K; ++OR) {
int s = sum(j, i - 1);
for(int k = 0; k < B; ++k) {
dp[i][OR | s][k + 1] |= dp[j][OR][k];
}
}
}
}
int ans = INT_MAX;
for(int i = A; i <= B; ++i) {
for(int OR = 0; OR < K; ++OR) {
if(dp[n][OR][i]) ans = min(ans, OR);
}
}
cout << ans << "\n";
}
int32_t main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t = 1;
//cin >> t;
while(t--) {
solve();
}
}
