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
#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;
const int MOD = 1e9 + 7;

struct Node {
    ll mul;
    ll add;
};

Node merge(Node left, Node right) {
    Node res;
    res.mul = (left.mul * right.mul) % MOD;
    res.add = (right.mul * left.add + right.add) % MOD;
    return res;
}

int n, q;
ll A[500005], B[500005];
Node tree[2000005];

void build(int v, int tl, int tr) {
    if (tl == tr) {
        if (B[tl] > 1) {
            tree[v] = {B[tl], 0};
        } else {
            tree[v] = {1, A[tl]};
        }
    } else {
        int tm = (tl + tr) / 2;
        build(2 * v, tl, tm);
        build(2 * v + 1, tm + 1, tr);
        tree[v] = merge(tree[2 * v], tree[2 * v + 1]);
    }
}

Node query(int v, int tl, int tr, int l, int r) {
    if (l == tl && r == tr) return tree[v];
    int tm = (tl + tr) / 2;
    if (r <= tm) return query(2 * v, tl, tm, l, r);
    if (l > tm) return query(2 * v + 1, tm + 1, tr, l, r);
    return merge(query(2 * v, tl, tm, l, tm), query(2 * v + 1, tm + 1, tr, tm + 1, r));
}

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

    if (!(cin >> n >> q)) return 0;
    for (int i = 1; i <= n; i++) cin >> A[i] >> B[i];

    build(1, 1, n);

    while (q--) {
        ll x;
        int l, r;
        cin >> x >> l >> r;
        l++; // runda l+1 do r

        int curr = l;
        while (curr <= r && x < MOD) {
            if (x * B[curr] > x + A[curr]) x *= B[curr];
            else x += A[curr];
            curr++;
            if (x >= MOD) break;
        }

        if (curr <= r) {
            Node res = query(1, 1, n, curr, r);
            x = (res.mul * (x % MOD) + res.add) % MOD;
        }

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

    return 0;
}