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
#include <bits/stdc++.h>
#include <iomanip>
 
using namespace std;
using ll = long long ;
using pii = pair <int,int> ;
using pll = pair<ll,ll> ;
using vi = vector <int> ; 
using vll = vector < ll > ;
using tiii = tuple<int,int,int> ; 
using ld = long double ; 

#define cYes {cout<<"YES\n";return;}
#define cNo {cout<<"NO\n";return;}
#define bra(x) "[" << (x) << "] "
#define ndl '\n' ;
#define all(x) (x).begin() , (x).end() 
#define sz(x) (int)(x).size() 
#define nd second 
#define st first
#define vvi vector<vector<int>> 

template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    return os << "(" << p.first << ", " << p.second << ")";
}

//#define DEBUG
#ifdef DEBUG 
#define dbg(x) cerr << #x << " = " << x << endl 
#else
#define dbg(x)
#endif

const ll MOD = 1e9+7 , maxn = 500'007 ;
ll N , Q ;
ll A[maxn] , B[maxn] ;
int next_Bidx[maxn] ;
ll pref_S[maxn] ; // suma tylko A ;


struct segTree { // PARA { A , B } SUMA(A) ILOCZYN(B)
    vector < pll > tree ;
    int Base ;
    segTree(int n){
        Base = 1 << (int)ceil(log2(n+5)) ;
        tree.resize(4*n+7,{0LL,1LL}) ;
    }
    void update( pll ip , int idx ){ // 1 idxed
        int v = Base + idx ;
        tree[v] = ip ;
        while(v!=0){
            v/=2 ;
            ll resL  = ( tree[v*2].st * tree[v*2+1].nd ) + tree[v*2+1].st ;
            ll resR = ( tree[v*2].nd * tree[v*2+1].nd ) ;
            resL %= MOD ;
            resR %= MOD ;
            tree[v] = {resL,resR} ;
        }
    }
    pll query(int l , int r , int tl , int tr , int v ){
        //cout << " l ,r , tl , tr , v " << l << ' ' << r << ' ' << tl << ' ' << tr << ' ' << v << endl ;
        if(tr < l or tl > r ) return{0,1} ;
        if( l <= tl and tr <= r ){
            return tree[v] ;
        }
        int mid = (tl+tr) / 2 ;
        pll resL = query(l,r,tl,mid,v*2) ;
        pll resR = query(l,r,mid+1,tr,v*2+1) ;
        
        ll ansL  = ( resL.st * resR.nd ) + resR.st ;
        ll ansR = ( resL.nd * resR.nd ) ;
        ansL %= MOD ;
        ansR %= MOD ;
        return {ansL,ansR} ;
    }
} ;

ll get_pref( int l , int r ){
    if( l > r ) return 0 ;
    return pref_S[r] - pref_S[l-1] ;
}
void precomp( segTree & t ){
    for(int i=1;i<=N;i++){
        pref_S[i] = A[i] + pref_S[i-1] ;
        if(B[i] > 1){
            t.update( {0,B[i]} , i ) ;
        }
        else{
            t.update( {A[i],1} , i ) ;
        }
    }
    // nextB>1
    int fresh = N+1 ; 
    for(int i=N;i>=1;i--){
        next_Bidx[i] = fresh ;
        if( B[i] > 1 ) fresh = i ;
    } // min ( N , next_B)
}

int main(){
    ios_base::sync_with_stdio(false) ; cin.tie(0) ;
    cin >> N >> Q ;
    for(int i=1;i<=N;i++){
        cin >> A[i] >> B[i] ;
    }
    segTree t(N) ;
    precomp( t ) ;
    
    
    
    
    {
        // cout << endl ; 
        // for(int i=1;i<=2*N;i++){
        //     dbg(t.tree[i]) ;
        // }
        // cout << endl ; 
    }
    while(Q--){
        ll tval , L , R ; 
        cin >> tval >> L >> R ;
        int curr = L + 1 ;
        
        bool wyjdz = false ;
        while( true ){
            tval = max( B[curr] * tval , A[curr] + tval ) ;
            if( tval > MOD or wyjdz ) break ;
            if( curr >= R ) break ;
            int nxtB = next_Bidx[curr] ;
            if( nxtB > R ) nxtB = R ;
            tval += get_pref(curr+1,nxtB-1) ;
            if(tval > MOD ){
                tval %= MOD ; 
                curr = nxtB - 1 ;
                break ;
            }
            curr = nxtB ;
        }
        // curr , wlacznie skonczony 
        ll tres = 0 ;
        tval %= MOD ;
        if( curr == R ){
            tres = tval ;
        }
        else{
            pll res = t.query(curr+1,R,0,t.Base-1,1) ;
            dbg(res.st) ; dbg(res.nd) ;
            tres = ( tval * res.nd ) + res.st    ;
        }
        tres %= MOD ;
        dbg(tres) ;
        cout << tres << ndl ;
    }
    
    return 0 ;
}