#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
struct node
{
    ll db, mul, l, r, m;
    node *lc, *rc;
    node(int il, int ir)
    {
        l = il;
        r = ir;
        m = (l + r) / 2;
        db = 0;
        mul = 1;
        lc = nullptr;
        rc = nullptr;
    }
    node * upd(int x, int val)
    {
        node *cur = new node(l, r);
        cur -> db = db + 1;
        cur -> mul = (mul * val) % MOD;
        cur -> lc = lc;
        cur -> rc = rc;
        if(l == r) return cur;
        if(x <= m) cur -> lc = lc -> upd(x, val);
        else cur -> rc = rc -> upd(x, val);
        return cur;
    }
    int sum(int tl, int tr)
    {
        if(tl > tr) return 0;
        if(tl == l && tr == r) return db;
        int m = (l + r) / 2;
        return lc -> sum(tl, min(tr, m)) + rc -> sum(max(tl, m + 1), tr);
    }
    ll sig(int tl, int tr)
    {
        if(tl > tr) return 1;
        if(tl == l && tr == r) return mul;
        int m = (l + r) / 2;
        return (lc -> sig(tl, min(tr, m)) * rc -> sig(max(tl, m + 1), tr)) % MOD;
    }
};
node* build(int il, int ir)
{
    node *cur = new node(il, ir);
    if(il == ir) return cur;
    cur -> lc = build(cur -> l, cur -> m);
    cur -> rc = build(cur -> m + 1, cur -> r);
    return cur;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, q;
    cin >> n >> q;
    vector<pair<int, int> > a(n);
    vector<node*> root(n + 1);
    root[0] = build(0, n - 1);
    for(int i = 0; i < n; i++)
    {
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(a.rbegin(), a.rend());
    for(int i = 0; i < n; i++)
    {
        root[i + 1] = root[i] -> upd(a[i].second, a[i].first);
    }
    while(q--)
    {
        int x, y, k;
        cin >> x >> y >> k;
        int l = 0, r = n + 1;
        while(l + 1 != r)
        {
            int m = (l + r) / 2;
            if(root[m] -> sum(x, y) <= k) l = m;
            else r = m;
        }
        cout << root[l] -> sig(x, y) << "\n";
    }
}