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

using namespace std;
using ll = long long;

const ll mod = 1e9+7;

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

    int n, q;
    cin >> n >> q;

    vector<pair<ll, ll>> zapis;
    zapis.push_back({0, 0});

    for(int i=0;i<n;i++)
    {
        ll a, b;
        cin >> a >> b;

        zapis.push_back({a, b});
    }

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

        if(x!=0)
        for(int j=l+1;j<=r;j++)
        {
            if(x+zapis[j].first>=x*zapis[j].second)
                x+=zapis[j].first;
            else
            {
                x*=zapis[j].second;
            }
            x%=mod;
        }

        cout << x << '\n';
    }

    return 0;
}