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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
#include <vector>
#include <iostream>

using namespace std;

typedef long long int ll;
#define MOD ll(1e9 + 7)

struct Node{
    ll a;
    ll b;
    Node(ll a, ll b) : a(a), b(b) {}

};

ll mul(ll a, ll b){
    return (a * b) % MOD;
}

ll add(ll a, ll b){
    return (a + b) % MOD;
}

int n, q;
vector<ll> A, B;

int tree_size = 1;
vector<Node> tree;

vector<ll> prefix_sum;
vector<ll> next_positive_A;
vector<ll> next_big_B;


Node query_interval(int node, int l, int r, int target_l, int target_r){
    if(node >= tree_size){
        return tree[node];
    }

    if (target_l <= l && r <= target_r){
        return tree[node];
    }

    int mid = (l + r) / 2;

    Node left(0, 1), right(0, 1);
    if (target_l <= mid) left = query_interval(2*node, l, mid, target_l, target_r);
    if (target_r > mid) right = query_interval(2*node + 1, mid + 1, r, target_l, target_r);

    ll b = mul(left.b, right.b);
    ll a = add(mul(left.a, right.b), right.a);
    return Node(a, b);

}


ll range_sum(int left, int right){
    if(left <= 0) return prefix_sum[right];
    return prefix_sum[right] - prefix_sum[left - 1];
}   


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n >> q;

    for(int i = 0; i < n; i++){
        ll a, b;
        cin >> a >> b;
        A.push_back(a);
        B.push_back(b);
    }

    while(tree_size <= n) tree_size *= 2;

    tree = vector<Node>(2*tree_size, Node(0, 1));

    for(int i = 0; i < n; i++){
        int idx = i + tree_size;
        if(B[i] <= 1){
            tree[idx].a = A[i];
            tree[idx].b = 1;
        }
        else{
            tree[idx].a = 0;
            tree[idx].b = B[i];
        }
    }

    for(int i = tree_size - 1; i >= 1; i--){
        int left = 2 * i;
        int right = 2 * i + 1;

        tree[i].b = mul(tree[left].b, tree[right].b);
        tree[i].a = add(mul(tree[left].a, tree[right].b), tree[right].a);
    }

    prefix_sum = vector<ll>(n, 0);
    next_positive_A = vector<ll>(n, n);
    next_big_B = vector<ll>(n, n);

    if(B[0] <= 1) prefix_sum[0] = A[0];
    for(int i = 1; i < n; i++) {
        if(B[i] <= 1) prefix_sum[i] = A[i];
        prefix_sum[i] += prefix_sum[i-1];
    }

    if (A[n-1] > 0) next_positive_A[n-1] = n-1;
    for(int i = n - 2; i >= 0; i--){
        if(A[i] > 0) next_positive_A[i] = i;
        else next_positive_A[i] = next_positive_A[i+1];
    }

    if (B[n-1] > 1) next_big_B[n-1] = n-1;
    for(int i = n - 2; i >= 0; i--){
        if(B[i] > 1) next_big_B[i] = i;
        else next_big_B[i] = next_big_B[i+1];
    }


    for(int i = 0; i < q; i++){
        ll x, l, r;
        cin >> x >> l >> r;

        if(x == 0){
            l = next_positive_A[l];
        }

        while (l < r){

            int next_pos = next_big_B[l];
            if (next_pos >= r){
                x = add(x, range_sum(l, r - 1));
                l = next_pos;
                break;
            }else{
                x += range_sum(l, next_pos);
                l = next_pos;
                if(x >= MOD){
                    x %= MOD;
                    break;
                }
            }

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

        if (l < r){
            Node tf = query_interval(1, 0, tree_size - 1, l, r - 1);
            x = add(mul(x, tf.b), tf.a);
        }

        cout << x % MOD << endl;
    }

    return 0;
}