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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
#include <bits/stdc++.h>
using namespace std;

const long long MOD = 1000000007LL;
const long long INF = (long long)4e18;

std::vector<pair<int,int>> decyzje;

struct zapisy {
    long long x;
    long long zd;
    long long zg;
    long long s;
};

vector<vector<zapisy>> dane;

long long policz_granice(long long a, long long b){
    if (b == 1) return INF;

    return (a + (b - 2)) / (b - 1);
}

long long licz_wynik(long long start, zapisy z){
    return ((z.x % MOD) * (start % MOD) + (z.s % MOD)) % MOD;
}

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

    int n, q;
    std::cin >> n >> q;

    decyzje.resize(n);
    for (int i = 0; i < n; i++){
        int x, y;
        std::cin >> x >> y;
        pair<int,int> para;
        para.first = x;
        para.second = y;
        decyzje[i] = para;
    }

    for (int query = 0; query < q; query++){
        long long start_x;
        int l, r;
        cin >> start_x >> l >> r;

        int m = r - l;   

        dane.clear();
        dane.resize(m);


        {
            long long a = decyzje[l].first;
            long long b = decyzje[l].second;
            long long granica = policz_granice(a, b);

            zapisy dodajemy;


            dodajemy.zd = 0;
            dodajemy.zg = granica - 1;
            dodajemy.x = 1;
            dodajemy.s = a;
            if (dodajemy.zd <= dodajemy.zg){
                dane[0].push_back(dodajemy);
            }

            dodajemy.zd = granica;
            dodajemy.zg = INF;
            dodajemy.x = b;
            dodajemy.s = 0;
            if (dodajemy.zd <= dodajemy.zg){
                dane[0].push_back(dodajemy);
            }
        }

        for (int i = 1; i < m; i++){
            long long a = decyzje[l + i].first;
            long long b = decyzje[l + i].second;
            long long granica = policz_granice(a, b);

            for(int z = 0; z < (int)dane[i-1].size(); z++){

                long long poprzednie_zd = dane[i-1][z].zd;
                long long poprzednie_zg = dane[i-1][z].zg;

                long long wartosc_na_dole;
                long long wartosc_na_gorze;

                __int128 dol = (__int128)dane[i-1][z].x * poprzednie_zd + dane[i-1][z].s;
                __int128 gora = (__int128)dane[i-1][z].x * poprzednie_zg + dane[i-1][z].s;

                if (dol > INF) wartosc_na_dole = INF;
                else wartosc_na_dole = (long long)dol;

                if (gora > INF) wartosc_na_gorze = INF;
                else wartosc_na_gorze = (long long)gora;

                if (wartosc_na_dole >= granica){
                    zapisy dodajemy;
                    dodajemy.zd = dane[i-1][z].zd;
                    dodajemy.zg = dane[i-1][z].zg;

                    __int128 nx = (__int128)dane[i-1][z].x * b;
                    __int128 ns = (__int128)dane[i-1][z].s * b;

                    dodajemy.x = (nx > INF ? INF : (long long)nx);
                    dodajemy.s = (ns > INF ? INF : (long long)ns);

                    dane[i].push_back(dodajemy);

                } else if (wartosc_na_gorze < granica){
                    zapisy dodajemy;
                    dodajemy.zd = dane[i-1][z].zd;
                    dodajemy.zg = dane[i-1][z].zg;
                    dodajemy.x = dane[i-1][z].x;

                    __int128 ns = (__int128)dane[i-1][z].s + a;
                    dodajemy.s = (ns > INF ? INF : (long long)ns);

                    dane[i].push_back(dodajemy);

                } else {

                    long long L = dane[i-1][z].zd;
                    long long R = dane[i-1][z].zg;
                    long long ostatni_dodawany = L - 1;

                    while (L <= R){
                        long long sr = (L + R) / 2;
                        __int128 wartosc = (__int128)dane[i-1][z].x * sr + dane[i-1][z].s;

                        if (wartosc < granica){
                            ostatni_dodawany = sr;
                            L = sr + 1;
                        } else {
                            R = sr - 1;
                        }
                    }

                    if (dane[i-1][z].zd <= ostatni_dodawany){
                        zapisy dodajemy;
                        dodajemy.zd = dane[i-1][z].zd;
                        dodajemy.zg = ostatni_dodawany;
                        dodajemy.x = dane[i-1][z].x;

                        __int128 ns = (__int128)dane[i-1][z].s + a;
                        dodajemy.s = (ns > INF ? INF : (long long)ns);

                        dane[i].push_back(dodajemy);
                    }

                    if (ostatni_dodawany + 1 <= dane[i-1][z].zg){
                        zapisy dodajemy;
                        dodajemy.zd = ostatni_dodawany + 1;
                        dodajemy.zg = dane[i-1][z].zg;

                        __int128 nx = (__int128)dane[i-1][z].x * b;
                        __int128 ns = (__int128)dane[i-1][z].s * b;

                        dodajemy.x = (nx > INF ? INF : (long long)nx);
                        dodajemy.s = (ns > INF ? INF : (long long)ns);

                        dane[i].push_back(dodajemy);
                    }
                }
            }
        }


        long long odpowiedz = 0;

        if (m == 1){
            for (int i = 0; i < (int)dane[0].size(); i++){
                if (dane[0][i].zd <= start_x && start_x <= dane[0][i].zg){
                    odpowiedz = licz_wynik(start_x, dane[0][i]);
                    break;
                }
            }
        } else {
            for (int i = 0; i < (int)dane[m-1].size(); i++){
                if (dane[m-1][i].zd <= start_x && start_x <= dane[m-1][i].zg){
                    odpowiedz = licz_wynik(start_x, dane[m-1][i]);
                    break;
                }
            }
        }

        cout << odpowiedz % MOD << "\n";
    }

    return 0;
}