Problem:
Score : 400 points

Problem Statement

One day, Niwango-kun, an employee of Dwango Co., Ltd., found an integer sequence (a_1, ..., a_N) of length N.
He is interested in properties of the sequence a.

For a nonempty contiguous subsequence a_l, ..., a_r (1 \leq l \leq r \leq N) of the sequence a, its beauty is defined as a_l + ... + a_r. Niwango-kun wants to know the maximum possible value of the bitwise AND of the beauties of K nonempty contiguous subsequences among all N(N+1)/2 nonempty contiguous subsequences. (Subsequences may share elements.)

Find the maximum possible value for him.

Constraints

2 \leq N \leq 1000

1 \leq a_i \leq 10^9

1 \leq K \leq N(N+1)/2

All numbers given in input are integers

Input

Input is given from Standard Input in the following format:

N K
a_1 a_2 ... a_N

Output

Print the answer.

Sample Input 1

4 2
2 5 2 5

Sample Output 1

12

There are 10 nonempty contiguous subsequences of a. Let us enumerate them:

contiguous subsequences starting from the first element: \{2\}, \{2, 5\}, \{2, 5, 2\}, \{2, 5, 2, 5\}

contiguous subsequences starting from the second element: \{5\}, \{5, 2\}, \{5, 2, 5\}

contiguous subsequences starting from the third element: \{2\}, \{2, 5\}

contiguous subsequences starting from the fourth element: \{5\}

(Note that even if the elements of subsequences are equal, subsequences that have different starting indices are considered to be different.)

The maximum possible bitwise AND of the beauties of two different contiguous subsequences is 12.
This can be achieved by choosing \{5, 2, 5\} (with beauty 12) and \{2, 5, 2, 5\} (with beauty 14).

Sample Input 2

8 4
9 1 8 2 7 5 6 4

Sample Output 2

32

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#include<utility>

#define int long long
using namespace std;
#define rep(i, n) for(int i=0;i<(n);++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound

int N, K;
int A[1010];
int Asum[1010];
vector<int> Alr;

signed main() {
    cin >> N >> K;
    rep(i, N) {
        cin >> A[i];
        Asum[i + 1] = Asum[i] + A[i];
    }
    rep(l, N) {
        for (int r = l; r < N; ++r) {
            Alr.push_back(Asum[r + 1] - Asum[l]);
        }
    }
    sort(Alr.begin(), Alr.end());
    int ans = 0;
    for (int max_bit = (1 << 29); max_bit > 0; max_bit >>= 1) {
        auto tmp = lower_bound(Alr.begin(), Alr.end(), max_bit);
        int n = Alr.end() - tmp;
        if (n >= K) {
            ans |= max_bit;
            vector<int> Blr;
            for (auto j = tmp; j != Alr.end(); ++j) {
                *j -= max_bit;
            }
            copy(tmp, Alr.end(), back_inserter(Blr));
            swap(Alr, Blr);

        } else {
            for (auto j = tmp; tmp != Alr.end(); ++tmp) {
                *j ^= max_bit;
            }
            sort(Alr.begin(), Alr.end());
        }
    }
    cout << ans << endl;
    return 0;
}