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

const int mxn = 500005;
pair<int, int> arr[mxn]; 
int pref[mxn];
int nas[mxn]; 


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, q; cin >> n >> q; 
    for (int i = 0; i < n; i++)
        cin >> arr[i].first >> arr[i].second;

    pref[0] = 0;
    for (int i = 1; i <= n; i++)
        pref[i] = pref[i-1] + arr[i].first;
    
    int last = -1;
    for (int i = n; i >= 0; i--){
        if (arr[i].second > 1)
            last = i;

        nas[i] = last;
    }
    
    while (q--){
        long long x; int l, r; cin >> x >> l >> r;
        
        bool less = 1;
        for (l; l < r; l++){
            x = max(arr[l].first+x, arr[l].second*x);
            if (x >= 500000007){
                less = 0;
                break;
            }
        }
        x %= 1000000007;
        if (!less){
            for (l= l+1; l < r; l++){
                if (arr[l].second > 1)
                    x = (x * arr[l].second) % 1000000007;
                else
                    x = (x + arr[l].first) % 1000000007;
            }        
        }
        cout << x << '\n';
    }
    return 0;
}