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
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
#include <bits/stdc++.h>
using namespace std;

#define ll long long

const ll MOD = 1'000'000'007;

ll b[500007];
ll a[500007];

ll suma[500007];
ll mulb[500007];
int nast[500007]; // następne b > 1

ll sufb[500007]; // iloczyn sufiksowy b
ll resta[500007]; // suma na sufiksie a odpowiadających b = 1 pomnożonych przez odpowiedni iloczyn b

ll pow(ll base, ll power) {
    ll w = 1LL;
    while (power > 0LL) {
        if (power % 2LL == 1LL) {
            w *= base;
            w %= MOD;
        }
        power /= 2LL;
        base *= base;
        base %= MOD;
    }
    return w;
}

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

    int n, q;
    cin >> n >> q;

    suma[0] = 0ll;
    mulb[0] = 1ll;

    ll maxa = 0;

    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
        suma[i] = (suma[i - 1] + a[i]) % MOD;
        mulb[i] = (mulb[i - 1] * b[i]) % MOD;

        maxa = max(maxa, a[i]);
    }

    sufb[n + 1] = 1;
    resta[n + 1] = 0;
    for (int i = n; i > 0; i--) {
        sufb[i] = (sufb[i + 1] * b[i]) % MOD;
        resta[i] = resta[i + 1];
        if (b[i] == 1) {
            resta[i] += (a[i] * sufb[i + 1]) % MOD;
            resta[i] %= MOD;
        }
        //assert(resta[i] >= 0LL);
        //assert(resta[i] <= MOD);
    }

    int last = n + 1;
    for (int i = n; i >= 0; i--) {
        nast[i] = last;
        if (b[i] > 1) {
            last = i;
        }
    }

    // for (int i = 0; i <= n; i++) {
    //     cout << suma[i] << " ";
    // }
    // cout << "\n";
    // for (int i = 0; i <= n; i++) {
    //     cout << mulb[i] << " ";
    // }
    // cout << "\n";
    // for (int i = 0; i <= n; i++) {
    //     cout << nast[i] << " ";
    // }
    // cout << "\n";

    // return 0;

    while (q > 0) {
        q--;

        ll x;
        int l, r;
        cin >> x >> l >> r;

        l++; // teraz l - pierwsze nieprzetworzone

        while (l <= r) {
            if (b[l] > 1) {
                x = max(x * b[l], x + a[l]);
                //assert(x >= 0ll);
                l++;
                // cerr << "step " << x << " " << l << "\n";
            }
            else {
                int jump = min(nast[l], r + 1);
                ll add = suma[jump - 1] - suma[l - 1];
                if (add < 0) add += MOD;
                x += add;

                //assert(x >= 0ll);
                l = jump;

                // cerr << "jump " << x << " " << l << "\n";
            }
            if (x >= maxa) {
                x %= MOD;
                //assert(x >= 0ll);
                break;
            }
            x %= MOD;
        }

        if (l <= r) { // trzeba domnożyć razy (mulb[r] / mulb[l - 1])
            x *= mulb[r];
            x %= MOD;
            x *= pow(mulb[l - 1], MOD - 2);
            x %= MOD;

            //assert(x >= 0ll);

            ll add = resta[l] - resta[r + 1];
            if (add < 0LL) add += MOD;
            //assert(x >= 0ll);
            x += (add * pow(sufb[r + 1], MOD - 2));
            x %= MOD;
            // if (x < 0ll) {
            //     cerr << add << " " << sufb[r + 1] << " " << pow(sufb[r + 1], MOD - 2) << "\n";
            // }
            //assert(x >= 0ll);
            
        }

        cout << x << "\n";
    }

    // return 0;
}