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
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

ll P(ll x)
{
    ll ans = 1;
    rep(bit,31)
    {
        if((MOD-2)&(1<<bit)) ans = (ans*x)%MOD;
        x = (x*x)%MOD;
    }
    return ans;
}

ll suf_mul[500003];
ll suf_sum[500003];
ll suf_sum2[500003];
int nxt_mul[500003];
pll opers[500003];

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n,q;
    cin >> n >> q;
    opers[0] = {0,1};
    rep2(i,1,n) cin >> opers[i].ff >> opers[i].ss;
    int prev_ = n+1;
    nxt_mul[n+1] = n+1;
    suf_mul[n+1] = 1;
    suf_sum[n+1] = 0;
    suf_sum2[n+1] = 0;
    for(int i = n; i >= 0; i--)
    {
        suf_mul[i] = (suf_mul[i+1]*opers[i].ss)%MOD;
        suf_sum[i] = suf_sum[i+1];
        suf_sum2[i] = suf_sum2[i+1]+opers[i].ff;
        if(opers[i].ss == 1) suf_sum[i] = (suf_sum[i+1]+opers[i].ff*suf_mul[i])%MOD;
        else prev_ = i;
        nxt_mul[i] = prev_;
    }
    rep(qq,q)
    {
        int l,r;
        ll ans;
        cin >> ans >> l >> r;
        int poz = l;
        while(ans < MOD)
        {
            if(poz > r) break;
            int nxt = min(r+1,nxt_mul[poz+1]);
            ans += suf_sum2[poz+1]-suf_sum2[nxt];
            poz = nxt-1;
            if(ans >= MOD || poz == r) break;
            poz++;
            ans = max(ans+opers[poz].ff,ans*opers[poz].ss);
        }
        ans %= MOD;
        ll del_mul = P(suf_mul[r+1]);
        ll total_mul = (suf_mul[poz+1]*del_mul)%MOD;
        ans = (ans*total_mul)%MOD;
        ans += (((suf_sum[poz+1]-suf_sum[r+1]+MOD)%MOD))*del_mul;
        cout << ans%MOD << "\n";
    }
}