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
// {{{
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>

#define each(...)    for (auto& __VA_ARGS__)
#define rep(i, b, e) for (int i = (b); i <= (e); i++)
#define rev(i, b, e) for (int i = (e); i >= (b); i--)
#define mp make_pair
#define mt make_tuple
#define x first
#define y second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define tC template<class
#define $(x) #x<<'='<<(x)<<' '

using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vb = vector<bool>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vpi = vector<pii>;
using vpl = vector<pll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
tC T, class C=greater<T>> using min_priority_queue = priority_queue<T,vector<T>,C>;
tC T> int sz(const T& a) { return (int)a.size(); }
tC T> bool amin(T& a, T b) { return b < a ? a = b, 1 : 0; }
tC T> bool amax(T& a, T b) { return b > a ? a = b, 1 : 0; }
const int oo = 1e9+1;
const ll OO = ll(1e18)+1;

auto now() { return chrono::high_resolution_clock::now().time_since_epoch().count(); }
mt19937 rnd(4488);
tC T> T rand(T lo, T hi) { return uniform_int_distribution<T>{lo,hi}(rnd); }

struct Debug {
#ifdef SPONGE
  tC T>Debug operator<<(const T& x) { cerr<<"\033[1;33m"<<x<<"\033[0m"; return *this; }
#else
  tC T>Debug operator<<(const T&) { return *this; }
#endif
} dbg;

namespace { void solve(); }
// }}}

int main()
{
  //freopen("input.txt","r",stdin);
  //freopen("output.txt","w",stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.precision(15);
  cout.setf(ios::fixed,ios::floatfield);
  cerr.precision(15);
  cerr.setf(ios::fixed,ios::floatfield);
  //rnd.seed(now());
  int t=1;
  //cin>>t;
  rep(i,1,t){
    //cout<<"Case #"<<i<<": ";
    solve();
  }
}

namespace {

const int MAX=1<<20;
const int MOD=1e9+7;

int n,q;
int a[MAX],b[MAX];
int jump[MAX];
ll pref[MAX];
pll tree[MAX];

// function: f(t) = x*t + y;
// compose: g(f(x))
pll compose(pll f,pll g)
{
  return { f.x*g.x%MOD, (g.x*f.y%MOD + g.y)%MOD };
}

pll pytaj(int l,int r)
{
  l+=MAX/2;
  r+=MAX/2;
  pll fl=mp(1,0),fr=mp(1,0);
  while(l<r){
    if(l%2==1) fl=compose(fl,tree[l]);
    if(r%2==0) fr=compose(tree[r],fr);
    l=(l+1)/2;
    r=(r-1)/2;
  }
  if(l==r) fl=compose(fl,tree[l]);
  return compose(fl,fr);
}

void solve()
{
  cin>>n>>q;
  rep(i,1,n) cin>>a[i]>>b[i];

  rep(i,1,n) pref[i]=pref[i-1]+a[i];

  rev(i,1,n){
    if(b[i]==1){
      if(b[i+1]==1) jump[i]=jump[i+1];
      else jump[i]=i;
    }
  }

  rep(i,1,n){
    if(b[i]==1) tree[i+MAX/2]=mp(1,a[i]);
    else tree[i+MAX/2]=mp(b[i],0);
  }
  rev(i,1,MAX/2-1) tree[i]=compose(tree[2*i],tree[2*i+1]);

  rep(i,1,q){
    ll x;
    int l,r;
    cin>>x>>l>>r;

    while(l<r && x<MOD){
      if(b[l+1]==1){
        int l_next=min(jump[l+1],r);
        x+=pref[l_next]-pref[l];
        l=l_next;
      }
      else{
        x=max(b[l+1]*x,x+a[l+1]);
        l++;
      }
    }

    x=x%MOD;
    pll f=pytaj(l+1,r);
    x=(f.x*x%MOD+f.y)%MOD;
    cout<<x<<endl;
  }

}

}