#include <bits/stdc++.h>
using namespace std;
const int nx=105, kx=51, inf=1e9;
#define ll long long
ll n, a, b, vl[nx], qs[nx], dp[nx];
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>a>>b;
for (int i=1; i<=n; i++) cin>>vl[i], qs[i]=qs[i-1]+vl[i];
ll ans=(1ll<<kx)-1;
for (int i=kx-1; i>=0; i--)
{
ll test=ans-(1ll<<i);
for (int i=1; i<=n; i++) dp[i]=inf;
for (int i=1; i<=n; i++)
{
for (int j=0; j<i; j++)
{
if (((qs[i]-qs[j])|test)==test)
{
dp[i]=min(dp[i], dp[j]+1);
}
}
}
if (dp[n]<=b) ans=ans-(1ll<<i);
}
cout<<ans;
}
