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
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;

struct Node {
    LL add;
    LL mul;
};

LL solve_query(LL x, int l, int r, const vector<pair<LL, LL>>& events) {
    for (int i = l; i < r; ++i) {
        LL a = events[i].first;
        LL b = events[i].second;
        if (x + a > x * b)
            x = (x + a) % MOD;
        else 
            x = (x * b) % MOD;
    }
    return x;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, q;
    cin >> n >> q;

    vector<pair<LL, LL>> events(n);
    for (int i = 0; i < n; ++i) {
        cin >> events[i].first >> events[i].second;
    }

    while (q--) {
        LL x;
        int l, r;
        cin >> x >> l >> r;
        cout << solve_query(x, l, r, events) << '\n';
    }
}