#include <bits/stdc++.h>
#define int long long
#define all(a) a.begin(), a.end()
using namespace std;

const int N = 5e4 + 10;
const int MOD = 1e9 + 7;

struct mat;
struct vec;

struct mat{
    vector<vector<int> > m;

    mat() :
        mat({{0,0,0,0},{0,0,0,0},{0,0,0,0},{0,0,0,0}}) {}

    mat(int k) :
        mat({{1, 1, 2*k, k*k},
             {0, 1, 2*k, k*k},
             {0, 0, 1, k},
             {0, 0, 0, 1}}) {}
    
    mat(vector<vector<int> > m) : m(m) {*this %= MOD;}

    const mat& operator%=(const int k){
        for(auto& x : m) for(auto& y : x) y %= k;
        return *this;
    }

    mat operator*(const mat& o){
        mat res = mat();

        for(int i = 0; i < 4; i++){
            for(int j = 0; j < 4; j++){
                for(int k = 0; k < 4; k++){
                    res.m[i][j] += m[i][k] * o.m[k][j];
                }
            }
        }

        res %= MOD;

        return res;
    }

    void print(){
        for(auto r : m){
            for(auto c : r){
                cout << c << ' ';
            }
            cout << '\n'; 
        }
    }
};

const mat I = mat({{1,0,0,0}, {0,1,0,0}, {0,0,1,0}, {0,0,0,1}});


struct vec{
    vector<int> v;

    vec() : vec({0,0,0,0}) {}
    vec(vector<int> v) : v(v) {*this%=MOD;}

    const vec& operator*=(const mat& o){
        v[0] += v[1] * o.m[0][1] + v[2] * o.m[0][2] + v[3] * o.m[0][3];
        v[1] += v[2] * o.m[1][2] + v[3] * o.m[1][3];
        v[2] += v[3] * o.m[2][3];
        *this %= MOD;
        return *this;
    }

    const vec& operator%=(const int k){
        for(int& x : v) x %= k;
        return *this;
    }

    vec operator+(const vec& o){
        vec res = vec();
        for(int i = 0; i < 4; i++) res.v[i] = v[i] + o.v[i];
        res %= MOD;
        return res;
    }

    void print(){
        for(int x : v) cout << x << ' '; cout << '\n';
    }
};

struct node{
    vec val;
    mat lz;

    node() : val(), lz(I) {}
    node(int x) : val({x*x,x*x,x,1}), lz(I) {}

} tr[4*N];

int a[N];

void build(int v, int l, int r){
    if(l == r){
        tr[v] = node(a[l]);
    } else{
        int mid = (l+r)/2;
        build(2*v, l, mid);
        build(2*v+1, mid+1, r);
        tr[v].val = tr[2*v].val + tr[2*v+1].val; 
    }
}

void push(int v){
    tr[2*v].val *= tr[v].lz;
    tr[2*v+1].val *= tr[v].lz;
    tr[2*v].lz = tr[v].lz * tr[2*v].lz;
    tr[2*v+1].lz = tr[v].lz * tr[2*v+1].lz;
    tr[v].lz = I;
}

void apply(int v){
    tr[v].val *= tr[v].lz;
    push(v);
}

void upd(int v, int l, int r, int ql, int qr, int k){
    if(ql > qr) return;
    if(l > qr || r < ql) return;
    if(ql <= l && r <= qr){
        tr[v].val *= mat(k);
        tr[v].lz = mat(k) * tr[v].lz;
        return;
    }
    int mid = (l+r)/2;
    push(v);
    upd(2*v, l, mid, ql, qr, k);
    upd(2*v+1, mid+1, r, ql, qr, k);
    tr[v].val = tr[2*v].val + tr[2*v+1].val;
}



int qry(int v, int l, int r, int ql, int qr){
    if(l > qr || r < ql) return 0;
    if(ql <= l && r <= qr){
        return tr[v].val.v[0];
    }
    push(v);
    int mid = (l+r)/2;
    return (qry(2*v, l, mid, ql, qr) + qry(2*v+1, mid+1, r, ql, qr))%MOD;
}

int32_t main(){
    ios::sync_with_stdio(false);
    cin.tie(0); 

    int n, m, q;
    cin >> n >> m >> q;
    for(int i = 1; i <= n; i++) cin >> a[i];
    build(1, 1, n);

    // for(int i = 1; i <= n; i++) cout << qry(1, 1, n, i,i) << ' '; cout << '\n';

    vector<array<int,5>> qry_v;
    vector<array<int,3>> upd_v(m);

    for(auto& [l, r, k] : upd_v){
        cin >> l >> r >> k;
    }
    for(int i = 0; i < q; i++){
        int l, r, x, y;
        cin >> l >> r >> x >> y;
        qry_v.push_back({x-1, l, r, -1, i});
        qry_v.push_back({y, l, r, 1, i});
    }
    sort(all(qry_v));
    vector<int> ans(q);
    int pre = 0;
    for(auto [t, l, r, tag, id] : qry_v){
        if(t < 0) continue;
        for(;pre<t; pre++){
            auto [ul, ur, k] = upd_v[pre];
            upd(1, 1, n, ul, ur, k);
            upd(1, 1, n, ur+1, n, 0);
            upd(1, 1, n, 1, ul-1, 0);
        }
        ans[id] += tag * qry(1, 1, n, l, r);
    }
    for(int i = 0; i < q; i++) cout << (ans[i]+MOD)%MOD << '\n';
}