1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
ll M = 1e9 + 7, base = 1048576, duzo = 2000000000, dod[500005], mno[500005], pref[500005], nast[500005];
pair<ll, ll> tre[2100005];

pair<ll, ll> skok(ll a, ll b) {
    pair<ll, ll> lwe = {1, 0}, rwe = {1, 0};
    ll p = a + base - 1, d = b + base + 1;
    while (p / 2 != d / 2) {
        if (p % 2 == 0) {
            lwe = {(lwe.f * tre[p + 1].f) % M, (lwe.s * tre[p + 1].f + tre[p + 1].s) % M};
        }
        if (d % 2 == 1) {
            rwe = {(tre[d - 1].f * rwe.f) % M, (tre[d - 1].s * rwe.f + rwe.s) % M};
        }
        p /= 2; d /= 2;
    }
    return {(lwe.f * rwe.f) % M, (lwe.s * rwe.f + rwe.s) % M};
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll N, Q;
    cin >> N >> Q;

    vector<pair<ll, ll>> v(N);
    for (ll i = 0; i < N; i++) {
        cin >> v[i].f >> v[i].s;
        dod[i] = v[i].f; mno[i] = v[i].s;
        pref[i + 1] = pref[i] + dod[i];
        if (mno[i] > 1) tre[i + base] = {mno[i] % M, 0};
        else tre[i + base] = {1, dod[i] % M};
    }

    for (int i = N; i < base; i++) tre[i + base] = {1, 0};
    for (int i = base - 1; i > 0; i--) {
        tre[i] = {(tre[2 * i].f * tre[2 * i + 1].f) % M, (tre[2 * i].s * tre[2 * i + 1].f + tre[2 * i + 1].s) % M};
    }

    ll ost = N;
    for (ll i = N - 1; i >= 0; i--) {
        if (mno[i] > 1) ost = i;
        nast[i] = ost;
    }

    while (Q--) {
        ll akt, l, r;
        cin >> akt >> l >> r;
        ll poz = l;
        while (poz < r && akt < duzo) {
            ll cel = min(r, nast[poz]);
            akt += pref[cel] - pref[poz];
            if (cel < r) {
                akt = max(akt + dod[cel], akt * mno[cel]);
                poz = cel + 1;
                continue;
            } 
            poz = r;
        }
        if (poz < r) {
            pair<ll, ll> res = skok(poz, r - 1);
            akt %= M;
            akt = (akt * res.f + res.s) % M;
        }
        cout << akt % M << "\n";
    }

    return 0;
}