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

#define MOD 1000000007
pair<long long, long long> jump[500007][22];

int Agtone[500007];
int Bgtone[500007];
int lastA = 0;
int lastB = 0;


vector<pair<long long, long long>> WYD;
vector<long long> PREF;

void solve(){
    long long X, L, R; cin >> X >> L >> R;
    bool MODULOED = false;
    int pos = L+1;
    
    if(X == 0){
        if(Agtone[pos] != -1){
            pos = Agtone[pos];
            if(pos <= R){
                X+=WYD[pos].first;
                if(X >= MOD){
                    MODULOED = true;
                    X%=MOD;
                }
            }
        }
        else{
            cout << 0 << "\n";
            return;
        }
        pos++;
    }
    //cerr << "POS: "<<pos << " " << X << "\n";
    while(pos <= R && !MODULOED){
        //cerr << "POS: "<<pos << " " << X << "\n";
        if(Bgtone[pos] != -1){
            int newpos = Bgtone[pos];
            if(newpos <= R){
                X+=PREF[newpos-1]-PREF[pos-1];
                if(newpos <= R){
                    if(X*WYD[newpos].second > X+WYD[newpos].first)
                        X*=WYD[newpos].second;
                    else
                        X+=WYD[newpos].first;
                    if(X >= MOD){
                        MODULOED = true;
                        X%=MOD;
                    }
                }
                pos = newpos;
            }
            else{
                X+=PREF[R]-PREF[pos-1];
                if(X >= MOD){
                    MODULOED = true;
                    X%=MOD;
                }
                pos = R;
            }
        }
        else{
            X+=PREF[R]-PREF[pos-1];
            if(X >= MOD){
                MODULOED = true;
                X%=MOD;
            }
            pos = R;
        }
        pos++;
    }
    int TARGET = R+1;
    for(int i = 20; i >= 0; --i){
        if(pos+(1 << i) <= TARGET){
            X*=jump[pos][i].first;
            X%=MOD;
            X+=jump[pos][i].second;
            X%=MOD;
            pos+=(1 << i);
        }
    }
    cout << X<< "\n";
}
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int N, Q; cin >> N >> Q;
    WYD.push_back({0,0});
    PREF.push_back(0);
    for(int l = 0; l < 500007; ++l){
        Agtone[l]=-1;
        Bgtone[l]=-1;
    }
    for(int i = 1; i <= N; ++i){
        long long A, B; cin >> A >> B;
        if(A > 0){
            for(int z = lastA; z <= i; ++z){
                Agtone[z]=i;
            }
            lastA=i+1;
        }
        if(B > 1){
            for(int z = lastB; z <= i; ++z){
                Bgtone[z]=i;
            }
            lastB = i+1;
        }
        WYD.push_back({A, B});
        PREF.push_back(PREF[PREF.size()-1]+A);
    }
    for(int i = 1; i <= N; ++i){
        if(WYD[i].second > 1){
            jump[i][0]={WYD[i].second, 0};
        }
        else
            jump[i][0]={1, WYD[i].first};
    }


    for(int j = 1; j <= 20; ++j){
        for(int i = 1; i <= N; ++i){
            long long Af = jump[i][j-1].first;
            long long As = jump[i][j-1].second;

            if(i+(1 << (j-1)) <= N){
                long long Bf = jump[i+(1 << (j-1))][j-1].first;
                long long Bs = jump[i+(1 << (j-1))][j-1].second;
                long long Ans1 = 0;
                long long Ans2 = 0;
                Ans2+=Bs;
                Ans2+=(As*Bf);
                Ans1+= Af*Bf;
                Ans1+=Ans2/MOD;
                Ans2%=MOD;
                Ans1%=MOD;
                jump[i][j]={Ans1, Ans2};
            }
            else{
                jump[i][j]={Af, As};
            }
        }
    }

    /*for(int k = 0; k < 4; ++k){
        for(int i = 1; i <= N; ++i){
            cout << jump[i][k].first << " " << jump[i][k].second << " | ";
        }
        cout << "\n";
    }*/


    while(Q--){
        solve();
    }
}