#include <iostream>
#include <algorithm>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 110, MAXM = 2010;

int n, L, R;
ll a[MAXM], sum[MAXN];

int f[MAXM];
inline void Solution1()
{
    ll msk = 0, res = 0;
    for (int s = 41; s >= 0; s--)
    {
        msk ^= (1ll << s);
        f[0] = 0;
        for (int i = 1; i <= n; i++)
        {
            f[i] = 2e9;
            for (int j = 0; j < i; j++)
                if (((sum[i] - sum[j]) & msk) == res)
                    f[i] = min(f[i], f[j] + 1);
        }
        if (f[n] > R) res ^= (1ll << s);
    }
    Write(res, '\n');
}

bool g[MAXN][MAXN];
inline void Solution2()
{
    ll msk = 0, res = 0;
    for (int s = 41; s >= 0; s--)
    {
        msk ^= (1ll << s);
        g[0][0] = 1;
        for (int i = 1; i <= n; i++)
        {
            for (int j = 0; j <= R; j++) g[i][j] = 0;
            for (int j = 0; j < i; j++)
                if (((sum[i] - sum[j]) & msk) == res)
                {
                    for (int k = 1; k <= R; k++)
                        g[i][k] |= g[j][k - 1];
                }
        }
        bool flag = 0;
        for (int i = L; i <= R; i++)
            if (g[n][i]) {flag = 1; break;}
        if (!flag) res ^= (1ll << s);
    }
    Write(res, '\n');
}

int main()
{
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(L), Read(R);
    for (int i = 1; i <= n; i++) Read(a[i]), sum[i] = sum[i - 1] + a[i];
    if (L == 1) Solution1();
    else Solution2();
    return 0;
}