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
#include <bits/stdc++.h>
#define mod 1000000007
using namespace std;

struct Node {
    long long a, b;
    //bro no czemu pointery sa takie wolne
    //pozdrawiam jakub rozek
    //pozdrawiam olaf targowski
    //pozdrawiam waldemar lamandindini
    //https://www.youtube.com/watch?v=dQw4w9WgXcQ
};

long long getint() {
    long long nm;
    char c = getchar_unlocked();
    while (c<'0' or c>'9') c = getchar_unlocked();
    nm = c - '0';
    c = getchar_unlocked();
    while (c >= '0' and c <= '9') {
        nm *= 10;
        nm += (c - '0');
        c = getchar_unlocked();
    }
    return nm;
}

void putint(long long nm) {
    if (nm >= 10) putint(nm / 10);
    putchar_unlocked('0' + nm % 10);
}

int n, q;
vector<long long>a, b, pref, prefm;
Node tree[1600009];
vector<int>nextmult, nextadd;

void build(int v, int l, int r) {
    if (l == r) {
        if (b[l] == 1) tree[v] = {1, a[l] % mod};
        else tree[v] = {b[l] % mod, 0};
        return;
    }
    int mid = (l + r) / 2;

    build(2 * v, l, mid);
    build(2 * v + 1, mid + 1, r);

    tree[v].a = tree[2 * v + 1].a * tree[2 * v].a % mod;
    tree[v].b = (tree[2 * v + 1].a * tree[2 * v].b + tree[2 * v + 1].b) % mod;
}

Node que(int v, int l, int r, int ql, int qr) {
    if (qr < l or r < ql) return {1, 0};
    if (ql <= l and r <= qr) return tree[v];

    int mid = (l + r) / 2;

    Node L = que(2 * v, l, mid, ql, qr);
    Node R = que(2 * v + 1, mid + 1, r, ql, qr);

    return {R.a * L.a % mod, (R.a * L.b + R.b) % mod};
}

int main() {
    n = getint();
    q = getint();

    a.resize(n + 1);
    b.resize(n + 1);
    pref.resize(n + 1);
    prefm.resize(n + 1);
    nextmult.resize(n + 2, n + 1);
    nextadd.resize(n + 2, n + 1);

    for (int i = 1; i <= n; i++) {
        a[i] = getint();
        b[i] = getint();
    }

    for (int i = 1; i <= n; i++) {
        pref[i] = pref[i - 1] + a[i];
        prefm[i] = (prefm[i - 1] + a[i]) % mod;
    }

    for (int i = n; i >= 1; i--) {
        if (b[i] > 1) nextmult[i] = i;
        else nextmult[i] = nextmult[i + 1];

        if (a[i] > 0) nextadd[i] = i;
        else nextadd[i] = nextadd[i + 1];
    }

    build(1, 1, n);

    while (q--) {
        long long x;
        int l, r;
        x = getint();
        l = getint();
        r = getint();

        int ind = l + 1;
        long long v = x;

        if (v == 0) {
            int p = nextadd[ind];

            if (p > r) {
                putint(0);
                putchar_unlocked('\n');
                continue;
            }

            v = a[p];
            x = a[p] % mod;
            ind = p + 1;
        }

        bool bul = 0;

        while (ind <= r and v < mod) {
            int m = nextmult[ind];

            if (m > r) {
                long long s = pref[r] - pref[ind - 1];
                long long sm = (prefm[r] - prefm[ind - 1] + mod) % mod;
                x = (x + sm) % mod;
                putint(x);
                putchar_unlocked('\n');
                bul = 1;
                break;
                //fallback
            }

            long long s = pref[m - 1] - pref[ind - 1];
            long long sm = (prefm[m - 1] - prefm[ind - 1] + mod) % mod;

            v += s;
            x += sm;
            x %= mod;

            ind = m;

            if (v >= mod) break;

            if (v == 0 or (b[m] - 1) == 0 or v <= a[m] / (b[m] - 1)) {
                v += a[m];
                x += a[m] % mod;
                x %= mod;
                //dodawanie
            }

            else {
                v *= b[m];
                x = (x * (b[m] % mod)) % mod;
                //mnozenie
            }

            ind = m + 1;

            if (v >= mod) break;

        }

        if (bul) continue;

        Node t = que(1, 1, n, ind, r);
        putint( (t.a * x + t.b) % mod );
        putchar_unlocked('\n');
    }
}