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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>

using namespace std;
using ll = long long;
using pll = pair<ll, ll>;

#define ff first 
#define ss second

const ll MOD = 1e9 + 7;

const int base = 1 << 19;
pll tree[2 * base];

int readint() {
    int val = 0, c = getchar_unlocked();

    while (!('0' <= c && c <= '9')) c = getchar_unlocked();
    while ('0' <= c && c <= '9') {
        val *= 10;
        val += c - '0';
        c = getchar_unlocked();
    }
    return val;
}

void writeint(int val) {
    if (val == 0) {
        putchar_unlocked('0');
        return;
    }

    char tab[11];
    int wsk = 0;
    while (val) {
        tab[wsk] = val % 10 + '0';
        val /= 10;
        wsk++;
    }
    while (wsk--) putchar_unlocked(tab[wsk]);
}

void newline() {
    putchar_unlocked('\n');
}

void space() {
    putchar_unlocked(' ');
}



vector<pll> tab;

//(a(a2 * x + b2) + b) = a * a2 * x + ab2 + b

pll lacz(pll f1, pll f2) {
    return {(f2.ff * f1.ff) % MOD, (f1.ss * f2.ff + f2.ss) % MOD};
}


void build(int v) {
    if (v >= base) {
        if (v - base >= tab.size()) return;
        tree[v] = tab[v - base]; 
        if (tree[v].ff != 1) tree[v].ss = 0; 
        return;
    }

    build(v * 2);
    build(v * 2 + 1);

    tree[v] = lacz(tree[v * 2], tree[v * 2 + 1]);

} 

pll query(int v, int vl, int vr, int l, int r) {
    if (vr < l || vl > r) return {1, 0};
    if (l <= vl && vr <= r) {
        return tree[v];
    }
    return lacz(query(v * 2, vl, (vl + vr) / 2, l, r), query(v * 2 + 1, (vl + vr) / 2 + 1, vr, l, r));
}




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

    int n, q;
    n = readint();
    q = readint();
    vector<ll> sumy(n, 0);
    vector<int> jump(n, 0);

    ll a, b, aktsum = 0;
    for (int i = 0; i < n; i++) {
        a = readint();
        b = readint();
        swap(a, b);
        tab.push_back({a, b});
        aktsum = aktsum + b;
        sumy[i] = aktsum;
        jump[i] = -1;
    }

    int wskk = -1;
    build(1);


    for (int i = n - 1; i >= 0; i--) {
        //cout << i << ' ' << tab[i].ff << ' ' << tab[i].ss << ' ' << wskk << '\n';
        if (tab[i].ff == 1) {
            wskk = max(wskk, i);
        }
        else wskk = -1;

        if (wskk != -1) {
            jump[i] = wskk;
        }
    }

    // for (int i = 0; i < n; i++) {
    //     cout << jump[i] << '\n';
    // }


    ll x, l, r;
    while (q--) {
        x = readint();
        l = readint();
        r = readint();
        r--;


        while (l <= r && x < 1e9 + 7) {
           // cout << l << ' ' << r << ' ' << x << ' ' << jump[l] << '\n';
            if (jump[l] != -1) {
                ll sl = 0;
                if (l) sl = sumy[l - 1];
                if (jump[l] >= r) {
                    x += sumy[r] - sl; 
                    l = r + 1;
                    break;
                }
                else {
                    x += sumy[jump[l]] - sl;
                    l = jump[l] + 1;
                }
            }
            else {
                x = max(x * tab[l].ff, x + tab[l].ss);
                l++;
            }
        }

        x %= MOD;

        //cout << l << ' ' << r << ' ' << x << '\n';

        if (l <= r) {
            pll qa = query(1, 0, base - 1, l, r);
            //cout << qa.ff << ' ' << qa.ss << '\n';
            x = (x * qa.ff + qa.ss) % MOD;
        }

        writeint(x);
        newline();

    }

    return 0;
}