beautiful_arry

#include<bits/stdc++.h>
using namespace std;
long long find_max (vector<long long>& arr, int len) {
   for (int i=32; i>=0; i--) {
      vector<long long> new_arr;
      int freq = 0;
      for (int j=0; j<arr.size();j++) {
         if ((arr[j]>>i)&1) new_arr.push_back(arr[j]);
      }
      if (new_arr.size() >= len) arr = new_arr;
   }

   long long ans = arr[0];
   for (int i=1; i<len;i++) ans &= arr[i];
   return ans;
}
vector<long long> solve (int n, int m, vector<int>& a, vector<vector<int>>& q) {
   vector<vector<long long>> sum (n+1);
   vector<long long> pre(n+1,0),ans, arr;
   for (int i=0; i<n;i++) {
      pre[i+1] += a[i] + pre[i];
   }
   for (int i=0; i<=n;i++) {
      for (int j =i+1; j <= n; j++) {
         sum[(j-i)].push_back((pre[j]-pre[i]));
      }
   }

   for (int i=0; i<m; i++) {
      int siz = q[i][0], len = q[i][1], x = q[i][2];
      arr = sum[siz];
      long long mx = find_max(arr,len);
      ans.push_back((x|mx));
   }
   return ans;
}

int main() {

    ios::sync_with_stdio(0);
    cin.tie(0);
    int N;
    cin >> N;
    int M;
    cin >> M;
    vector<int> A(N);
    for(int i_A = 0; i_A < N; i_A++)
    {
    	cin >> A[i_A];
    }
    vector<vector<int> > Q(M, vector<int>(3));
    for (int i_Q = 0; i_Q < M; i_Q++)
    {
    	for(int j_Q = 0; j_Q < 3; j_Q++)
    	{
    		cin >> Q[i_Q][j_Q];
    	}
    }

    vector<long long> out_;
    out_ = solve(N, M, A, Q);
    cout << out_[0];
    for(int i_out_ = 1; i_out_ < out_.size(); i_out_++)
    {
    	cout << " " << out_[i_out_];
    }
}