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

using namespace std;
using ll = long long;
vector<pair<ll,ll>> tab;
const ll mod = 1e9+7;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n,m;
    cin >> n >> m;
    for(int i =0;i<n;i++){
        int a,b;
        cin >> a >> b;
        tab.push_back({a,b});
    }
        for(int i =0;i<m;i++)
        {
            ll a,b,c;
            cin >> a >> b >> c;
            ll wynik = a%mod;
            ll ile =a;

            for(int j =b;j<c;j++){
                ll dod1 = (wynik+tab[j].first)%mod;
                ll mnoz1 = (wynik*tab[j].second)%mod;
                if(ile<mod){
                    ll dod2=ile+tab[j].first;
                    ll mnoz2 = ile*tab[j].second;

                    if(mnoz2>dod2){
                        ile = min(mnoz2,mod);
                        wynik=mnoz1;
                    }
                    else{
                        ile = min(dod2,mod);
                        wynik=dod1;
                    }
                }
                else{
                    if(tab[j].second>1){
                        wynik= mnoz1;
                    }
                    else wynik =dod1;
                }
            }
            cout << wynik << '\n';
        }
    return 0;
}