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

using namespace std;

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

struct Transform {
    ll m, a;
};

Transform combine(const Transform& f, const Transform& g) {
    return {
        (f.m * g.m) % MOD,
        (f.a * g.m + g.a) % MOD
    };
}

const int MAXN = 500005;
ll A[MAXN], B[MAXN];
ll prefA[MAXN];
Transform tree[4 * MAXN];
vector<int> bigB;

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

Transform query_tree(int v, int tl, int tr, int l, int r) {
    if (l > r) return {1, 0};
    if (l == tl && r == tr) return tree[v];
    int tm = (tl + tr) / 2;
    return combine(query_tree(2 * v, tl, tm, l, min(r, tm)),
                   query_tree(2 * v + 1, tm + 1, tr, max(l, tm + 1), r));
}

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

    int n, q;
    if (!(cin >> n >> q)) return 0;

    prefA[0] = 0;
    for (int i = 1; i <= n; ++i) {
        cin >> A[i] >> B[i];
        prefA[i] = (prefA[i - 1] + A[i]) % MOD;
        if (B[i] >= 2) {
            bigB.push_back(i);
        }
    }

    build(1, 1, n);

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

        int curr = l;
        auto it = lower_bound(bigB.begin(), bigB.end(), curr);

        while (it != bigB.end() && *it <= r) {
            int pos = *it;
            
            if (pos > curr) {
                x = (x + (prefA[pos - 1] - prefA[curr - 1] + MOD)) % MOD;
            }

    
            if ((__int128)x * B[pos] >= (__int128)x + A[pos]) {
                x = (x * B[pos]) % MOD;
            } else {
                x = (x + A[pos]) % MOD;
            }

            curr = pos + 1;
            
            if (x >= MOD - 1) { 
                if (curr <= r) {
                    Transform res = query_tree(1, 1, n, curr, r);
                    x = (x * res.m + res.a) % MOD;
                }
                curr = r + 1;
                break;
            }
            it++;
        }

        if (curr <= r) {
            x = (x + (prefA[r] - prefA[curr - 1] + MOD)) % MOD;
        }

        cout << (long long)x << "\n";
    }

    return 0;
}