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
#include "bits/stdc++.h"
using namespace std;

constexpr int MOD = 1000000007;
using ll = long long;

struct SegmentTree {
    int p = 2, M;
    vector <ll> tree, lazy_mul;
    
    SegmentTree(int n) {
        while ((1 << p) - (1 << (p - 1)) < n) p++;
        M = (1 << (p - 1));
        tree.resize(1 << p, 0);
        lazy_mul.resize(1 << p, 1);
    }

    void _lazy_build(int x) {
        for (int i = p - 1; i >= 1; i--) {
            int index = (x >> i);
            _push(index);
        }
    }

    void _push(int x) {
        tree[2 * x] = (tree[2 * x] * lazy_mul[x]) % MOD;
        tree[2 * x + 1] = (tree[2 * x + 1] * lazy_mul[x]) % MOD;
        tree[2 * x] += tree[x];
        tree[2 * x + 1] += tree[x];
        if (tree[2 * x] >= MOD) tree[2 * x] -= MOD;
        if (tree[2 * x + 1] >= MOD) tree[2 * x + 1] -= MOD;
        if (2 * x < M) lazy_mul[2 * x] = (lazy_mul[2 * x] * lazy_mul[x]) % MOD;
        if (2 * x + 1 < M) lazy_mul[2 * x + 1] = (lazy_mul[2 * x + 1] * lazy_mul[x]) % MOD;
        tree[x] = 0;
        lazy_mul[x] = 1;
    }

    void mul(ll x) {
        tree[1] = (tree[1] * x) % MOD;
        lazy_mul[1] = (lazy_mul[1] * x) % MOD;
    }

    void add(ll x) {
        tree[1] += x;
        if (tree[1] >= MOD) tree[1] -= MOD;
    }    

    void put(int i, ll x) {
        i += M;
        _lazy_build(i);
        tree[i] = x;
    }

    ll pop(int i) {
        i += M;
        _lazy_build(i);
        return tree[i];
    }
};

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

    int n, q;
    cin >> n >> q;
    vector <pair <int, int>> v(n);
    for (auto &[a, b] : v) {
        cin >> a >> b;
    }

    vector <int> jump(n);
    int next_jump = n;
    for (int i = n - 1; i >= 0; i--) {
        jump[i] = next_jump;
        if (v[i].second > 1) next_jump = i;
    }

    vector <ll> pref_add(n, 0);
    for (int i = 0; i < n; i++) {
        pref_add[i] = v[i].first;
        if (i) pref_add[i] += pref_add[i - 1];
    }

    auto query_pref_add = [&](int l, int r) -> ll {
        if (l > r) return 0LL;
        ll ans = pref_add[r];
        if (l - 1 >= 0) ans -= pref_add[l - 1];
        return ans;
    };

    vector <vector <tuple <int, int, int>>> events(n + 1);
    vector <int> ans(q);
    for (int i = 0; i < q; i++) {
        ll x;
        int l, r;
        cin >> x >> l >> r;
        while (l < r) {
            ll add = x + v[l].first, mul = x * v[l].second;
            ll best = max(add, mul);
            x = best;
            if (x >= MOD) {
                x %= MOD;
                l = l + 1;
                break;
            }

            ll next_l = min(r, jump[l]);
            ll range_add = query_pref_add(l + 1, next_l - 1);
            if (range_add >= MOD || (x + range_add) >= MOD) {
                x = (x + range_add % MOD) % MOD;
                l = next_l;
                break;
            }

            x += range_add;
            l = next_l;
        }
        if (l != r) {
            events[l].push_back({0, i, x});
            events[r].push_back({1, i, 0});
        } else ans[i] = x;
    }

    SegmentTree ST(q);
    for (int i = 0; i <= n; i++) {
        for (auto [op, index, val] : events[i]) {
            if (op == 0) {
                ST.put(index, val);
            } else {
                ans[index] = ST.pop(index);
            }
        }

        if (i == n) break;
        if (v[i].second == 1) ST.add(v[i].first);
        else ST.mul(v[i].second);
    }

    for (auto x : ans) {
        cout << x << '\n';
    }
}