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
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <bits/stdc++.h>
#define ssize(x) int(x.size())
#define all(x) x.begin(),x.end()
#define V vector
using namespace std;
typedef long long ll;
int mod = 1e09+7;
int add(int a, int b) { return a+b >= mod ? a+b-mod : a+b; }
int sub(int a, int b) { return add(mod-b, a); }
int mul(int a, int b) { return int(a*ll(b)%mod); }
int fpow(int a, int b = mod-2) {
    int res = 1;
    while(b) {
        if (b & 1) res = mul(res, a);
        b >>= 1, a = mul(a, a);
    }
    return res;
}
int divd(int a, int b) {
    return mul(a, fpow(b));
}
void answer() {
    int n, q; scanf("%d%d", &n, &q);
    V<int> a(n+1, 0), b(n+1, 1);
    set<int> pos;
    for (int i = 1; i <= n; ++i) {
        scanf("%d%d", &a[i], &b[i]);
        if (b[i] != 1) pos.emplace(i);
    }
    V<int> sf_mul(n+2, 1);
    for (int i = n; i >= 1; --i) sf_mul[i] = mul(sf_mul[i+1], b[i]);

    V<ll> pf_add(n+1, 0);
    V<int> pf_add_win(n+1, 0);
    for (int i = 1; i <= n; ++i) {
        pf_add[i] = pf_add[i-1] + a[i];
        int add_win = b[i] == 1 ? mul(a[i], sf_mul[i+1]) : 0;
        pf_add_win[i] = add(pf_add_win[i-1], add_win);
    }

    for (++q; --q; ) {
        ll X; int l, r, nxt; scanf("%lld%d%d", &X, &l, &r);
        auto it = pos.upper_bound(l);
        while (X < ll(mod) && l < r && (it = pos.upper_bound(l)) != pos.end()) {
            nxt = *it;
            X += pf_add[min(r, nxt-1)] - pf_add[l];
            l = nxt-1;
            if (X >= ll(mod) || l >= r) break;
            X = max(X+a[nxt], X*b[nxt]);
            ++l;
        }
        if (l >= r) { printf("%lld\n", X % mod); continue; }

        int x = int(X % mod);
        x = mul(x, sf_mul[l+1]);
        x = add(x, sub(pf_add_win[r], pf_add_win[l]));
        x = divd(x, sf_mul[r+1]);
        printf("%d\n", x);
    }
}
int main() {
    int T = 1; //scanf("%d", &T);
    for (++T; --T; ) answer();
    return 0;
}