#include <bits/stdc++.h>
using namespace std;

#define lf "\n"
#define ff endl
#define _ << ' ' <<
#define all(x) begin(x),end(x)
#define rall(x) rbegin(x),rend(x)

#define infor(str, ...) do { fprintf(stderr, str, ##__VA_ARGS__); } while(0)
#define infof(str, ...) do { fprintf(stderr, str"\n", ##__VA_ARGS__); } while(0)

#ifndef DEBUG

#undef infor
#undef infof

#define infor(str, ...)
#define infof(str, ...)

#endif

using ll = long long;

constexpr int LOG = 20;
constexpr int MOD = 1e9+7;
constexpr int MAXN = 1e5+7;

struct SegTree {
    SegTree(int N): N(N), st(2 * N) {}

    void update(int v, ll x) {
        st[v += N] = x;

        for(v >>= 1; v > 0; v >>= 1)
            st[v] = st[v << 1] + st[v << 1 | 1];
    }

    ll query(int l, int r) {
        ll sum = 0;

        for(l += N, r += N; l < r; l >>= 1, r >>= 1) {
            if(l&1) sum += st[l++];
            if(r&1) sum += st[--r];
        }

        return sum;
    }

    int N;
    vector<ll> st;
};

void solve(void) {
    int N, Q; cin >> N >> Q;

    vector<ll> V(N);
    for(auto &x: V) cin >> x;

    vector<array<ll, 3>> Qs(Q);
    for(auto &[x, l, r]: Qs) cin >> l >> r >> x, l--;

    vector<int> ordV(N), ordQ(Q);
    iota(all(ordV), 0); iota(all(ordQ), 0);

    sort(all(ordV), [&](int i, int j) -> bool {
        return V[i] > V[j];
    });

    sort(all(ordQ), [&](int i, int j) -> bool {
        return Qs[i] > Qs[j];
    });

    SegTree st(N);

    vector<ll> ans(Q);

    int vi = 0;
    for(auto q: ordQ) {
        auto [x, l, r] = Qs[q];

        while(vi < N && V[ordV[vi]] >= x) {
            int i = ordV[vi++];
            st.update(i, V[i]);
        }

        ans[q] = st.query(l, r);
    }

    for(auto x: ans)
        cout << x << lf;
}

int main(void) {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int T; cin >> T;
    while(T--) solve();
}