#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pob pop_back
#define eb emplace_back
#define nall(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define yesno(a) cout<<(a?"Yes\n":"No\n")
#define lb lower_bound
#define ub lower_bound
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template<class T> using vec = vector<T>;
template<class T> using vv = vector<vector<T>>;
template<class T> using vvv = vector<vv<T>>;
template<class T> using vvvv = vector<vvv<T>>;
template<class T> using vvvvv = vector<vvvv<T>>;

void solve();
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    unsigned T = 1;
    // cin >> T;
    cout << fixed << setprecision(20);
    while (T--) solve();
    return 0;
}

void solve(){
    int N, Q;
    cin >> N >> Q;
    vector<ll> S{0};
    rep(i, N){
        int x;
        cin >> x;
        S.pb(S[i]+x);
    }

    while (Q--){
        int l, r, k;
        cin >> l >> r >> k;
        cout << S[r]-S[l-1] << endl;
    }
}