#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define sc second
#define int ll

void solve() {
    int n, a, b; cin >> n >> a >> b;
    vector<int> x(n);
    for (int i = 0; i < n; i++) cin >> x[i];

    vector<int> pref(n + 1);
    for (int i = 1; i <= n; i++) pref[i] = pref[i - 1] + x[i - 1];

    vector<int> no_bits;
    int sm = 0;
    for (int bit = 50; bit >= 0; bit--) {
        vector<pair<int, int>> dp(n + 1, {n + 1, -1});
        dp[0] = {0, 0};
        no_bits.pb(bit);
        for (int pr = 1; pr <= n; pr++) {
            for (int pr_p = 0; pr_p < pr; pr_p++) {
                bool gs = true;
                for (int bt : no_bits) {
                    if (((pref[pr] - pref[pr_p]) >> bt) & 1) gs = false;
                }
                if (gs) {
                    dp[pr].first = min(dp[pr].first, dp[pr_p].first + 1);
                    dp[pr].second = max(dp[pr].second, dp[pr_p].second + 1);
                }
            }
        }
        if (b < dp[n].first || a > dp[n].second) {
            sm += (1 << bit);
            no_bits.pop_back(); 
        }
    }   
    cout << sm << '\n';
}

signed main() {
    int tt = 1;
    #ifdef LOCAL 
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        cin >> tt;
    #else
        ios::sync_with_stdio(false); 
        cin.tie(0); cout.tie(0);
    #endif

    while (tt--) {
        solve();
    }

    return 0;
}