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
#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
const int M=1e9+7;
const int N=500012;
int plusy[N];
int razy[N];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,q;
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>plusy[i]>>razy[i];
    }
    for(int i=0;i<q;i++){
        int x,l,r;
        cin>>x>>l>>r;
        long long w=x;
        for(int j=l+1;j<=r;j++){
            if((long long)plusy[j]+w>(long long)razy[j]*w){
                w+=plusy[j];
            }else{
                w*=razy[j];
            }
            w%=M;
        }
        cout<<w<<"\n";
    }
    return 0;
}