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
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
#include <vector>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <queue>
#include <map>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <cstring>
#include <bitset>
#include <iostream>
#include <queue>
#include <iomanip>
#include <complex>

using namespace std;

#define ALL(x) x.begin(), x.end()
#define UNIQUE(c) (c).resize(unique(ALL(c)) - (c).begin())
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define RED(i, n) FORD(i, n, 1)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define REPD(i, n) FORD(i, n-1,0)

#define printA(a, L, R) FOR(i,L,R) cout << a[i] << (i==R?'\n':' ')
#define printV(a) printA(a,0,a.size()-1)
#define PRESENT(c, x) ((c).find(x) != (c).end())
#define CPRESENT(c, x) (find(ALL(c),x) != (c).end())
#define bit(x, i) (x&(1<<i))
#define lowbit(x) ((x)&((x)^((x)-1)))

const int fx[4][2] = {
    {0, 1},
    {1, 0},
    {0, -1},
    {-1, 0}
};
const int fxx[8][2] = {
    {0, 1},
    {0, -1},
    {1, 0},
    {-1, 0},
    {1, 1},
    {1, -1},
    {-1, 1},
    {-1, -1}
};
const int sk[8][2] = {
    {2, 1},
    {2, -1},
    {-2, -1},
    {-2, 1},
    {1, 2},
    {-1, 2},
    {1, -2},
    {-1, -2}
};

const int maxa = 202112, maxn = 500024, maxp = 60;
const long long maxc = 40002, maxc2 = 25002, inf = 4000000000000000001ll;
const long long mod = 1000000007ll;
long long pot(long long a, long long b) {
    if (b == 0) return 1;
    if (b&1) return (pot(a, b - 1) * a) % mod;
    long long c = pot(a, b / 2);
    return (c * c) % mod;
}
long long n, q, d[maxn], m[maxn], pref[maxn], nem[maxn], sud[maxn], sum[maxn],x,l,r;
void solve() {
    cin>>n>>q;
    RE(i, n) {
        cin>>d[i]>>m[i];
        if (m[i] == 1)pref[i] = (pref[i - 1] + d[i]) % mod;
    }
    long long ne = n + 1;
    sum[n + 1] = 1;
    RED(i, n) {
        if (m[i] > 1)ne = i;
        nem[i] = ne;
        if (m[i] == 1) {
            sum[i] = sum[i + 1];
            sud[i] = (sud[i + 1] + d[i] * sum[i]) % mod;
        } else {
            sud[i] = sud[i + 1];
            sum[i] = (sum[i + 1] * m[i]) % mod;
        }
    }
    while (q--) {
        cin>>x>>l>>r;
        long long pos = l + 1;
        while (pos <= r) {
            if (nem[pos] == pos) {
                x = max(x + d[pos], x * m[pos]);
                pos ++;
                if (x >= mod) {
                    x %= mod;
                    break;
                }
            } else {
                if (nem[pos] > r) {
                    x = (x + (pref[r] - pref[pos - 1] + mod)) % mod;
                    pos = r + 1;
                    break;
                }
                x = (x + (pref[nem[pos] - 1] - pref[pos - 1] + mod)) % mod;
                pos = nem[pos];
            }
        }
        if (pos <= r) {
            x = (x * sum[pos]) % mod;
            x = (x + sud[pos]) % mod;
            x = (x - sud[r + 1] + mod) % mod;
            x = (x * pot(sum[r + 1], mod - 2)) % mod;
        }
        cout<<x<<"\n";
    }
}

int main() {
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    int tt = 1;
    // cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}