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
#include <bits/stdc++.h>
#define FOR(i,p,k) for(int i=(p);i<=(k);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define RFOR(i,p,n) for(int i=(p);i>=(n);--i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define ssize(x) int((x).size())
#define fi first
#define se second
#define V vector
#define pb push_back
#define eb emplace_back
#define C const
#define gc getchar_unlocked
#define pc putchar_unlocked
#define pn putchar_unlocked('\n')
using namespace std;
typedef long long ll;
typedef __int128_t lll;
typedef V<int> vi;
typedef V<ll> vll;
typedef const int ci;
typedef const ll cll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
void chmin(auto &a, auto b){a=min(a,b);}
void chmax(auto &a, auto b){a=max(a,b);}
ci inf = 2.1e9;
cll infll = 4.5e18;
int I(){
    int z;
    int c = gc();
    while(c < '0' || c > '9') c = gc();
    for(z = 0; c >= '0' && c <= '9'; c = gc()) z = 10*z+c-'0';
    return z;
}
void O(int a){
    static int tab[20];
    int it = 0;
    do{
        tab[it++] = int('0'+a%10);
    } while(a /= 10);
    while(it) pc(tab[--it]);
}

cll mod = ll(1e9)+7;
ll add(cll a, cll b){
    return a+b<mod ? a+b : a+b-mod;
}
ll mul(cll a, cll b){
    return (a*b)%mod;
}
pll zlozenie(pll a, pll b){
    return pll{mul(a.fi, b.fi), add(mul(a.se, b.fi), b.se)};
}
ll ewal(pll f, ll x){
    return add(mul(x, f.fi), f.se);
}

struct prz{
    int N;
    V<pll> t;
    prz(int n, V<pll> ciag){
        for(N = 1; N < n;) N *= 2;
        t.resize(N*2, pll{1, 0});
        FOR(i, 1, n) t[i+N-1] = ciag[i];
        RFOR(i, N-1, 1) t[i] = zlozenie(t[i*2], t[i*2+1]);
    }
    pll lacznie(int p, int k){
        pll lewo{1, 0}, prawo{1, 0};
        for(p+=N, k+=N; p<k; p/=2, k/=2){
            if(p&1) lewo = zlozenie(lewo, t[p++]);
            if(k&1) prawo = zlozenie(t[--k], prawo);
        }
        return zlozenie(lewo, prawo);
    }
};

void answer(){
    ci n = I();
    ci q = I();
    vll a(n+1), b(n+1);
    FOR(i, 1, n){
        a[i] = I();
        b[i] = I();
    }

    vi nast_niezeroa(n+1, n);
    RFOR(i, n-1, 0) nast_niezeroa[i] = a[i+1]>=1 ? i : nast_niezeroa[i+1];

    vi nast_niejedenb(n+1, n);
    RFOR(i, n-1, 0) nast_niejedenb[i] = b[i+1]>=2 ? i : nast_niejedenb[i+1];

    vll sumpref(n+1, 0);
    FOR(i, 1, n) sumpref[i] = sumpref[i-1]+a[i];

    V<pll> ciag(n+1);
    FOR(i, 1, n) ciag[i] = b[i]>=2 ? pll{b[i], 0} : pll{1, a[i]};
    prz janusz(n, ciag);

    REP(_, q){
        bool duze = false;
        ll x = I();
        int poc = I();
        ci kon = I();
        if(x == 0){
            poc = min(kon, nast_niezeroa[poc]);
            if(poc < kon){
                ++poc;
                x += a[poc];
                if(x >= mod) x %= mod, duze = true;
            }
        }
        while(poc < kon){
            if(duze){
                x = ewal(janusz.lacznie(poc, kon), x);
                break;
            }
            ci nowypoc = min(kon, nast_niejedenb[poc]);
            x += sumpref[nowypoc]-sumpref[poc];
            if(x >= mod) x %= mod, duze = true;
            poc = nowypoc;
            if(poc < kon){
                ++poc;
                if(duze || x*b[poc] >= x+a[poc]) x *= b[poc];
                else x += a[poc];
                if(x >= mod) x %= mod, duze = true;
            }
        }
        O(int(x)), pn;
    }
}

int main(){
    int tt = 1;
    while(tt--) answer();
}