#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int N = 2007;
int n, L, R;
ll a[N];
bool valid[N][N];
bool isSubMask(ll x, ll y){
return ((x & y) == x) && ((x | y) == y);
}
namespace Sub4{
bool dp[N][N];
void solve(){
ll ans = 0;
for(int bit = 40; bit >= 0; --bit){
ans = ans * 2;
for(int i = 1; i<=n; ++i){
ll sum = 0;
for(int j = i; j<=n; ++j){
sum += a[j];
valid[i][j] = isSubMask(sum >> bit, ans);
}
}
memset(dp, 0, sizeof dp);
dp[0][0] = 1;
bool check = false;
for(int layer = 1; layer <= R; ++layer){
for(int i = 1; i<=n; ++i)
for(int j = i; j>=1; --j) if (dp[layer-1][j-1] && valid[j][i]) {
dp[layer][i] = true;
}
if (layer >= L && dp[layer][n]){
check = true;
break;
}
}
if (!check) ans++;
}
cout << ans << "\n";
exit(0);
}
}
namespace Sub5{
int dp[N];
void solve(){
ll ans = 0;
for(int bit = 40; bit >= 0; --bit){
ans = ans * 2;
for(int i = 1; i<=n; ++i){
ll sum = 0;
for(int j = i; j<=n; ++j){
sum += a[j];
valid[i][j] = isSubMask(sum >> bit, ans);
}
}
memset(dp, 63, sizeof dp);
dp[0] = 0;
for(int i = 0; i<n; ++i) if (dp[i] < 1e9)
for(int j = i + 1; j<=n; ++j) if (valid[i+1][j]) minimize(dp[j], dp[i] + 1);
if (dp[n] > R) ans++;
}
cout << ans << "\n";
exit(0);
}
}
int main(void){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> L >> R;
for(int i= 1; i<=n; ++i) cin >> a[i];
if (L > 1) Sub4::solve();
else Sub5::solve();
return 0;
}
