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
#include <bits/stdc++.h>
#pragma GCC target ("avx2,fma")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
using namespace std;
int inf=1000000007;
ll infl=1000000000000000007;
const ll mod=1000000007;

#ifdef LOCAL
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

const int N=500007,L=19,pot=1<<19;

ll pw(ll x,ll p) {ll res=1;for(;p;p>>=1) {if(p&1) res=res*x%mod; x=x*x%mod;} return res;}
ll T[N];
ll K[N];

ll a[N],b[N];
ll sum[L][N];
ll mx[L][N];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,q;
    cin>>n>>q;
    FOR(i,1,n)
    {
		cin>>a[i]>>b[i];
		if(b[i]==1) mx[0][i]=infl;
		else mx[0][i]=a[i]/(b[i]-1);
		sum[0][i]=a[i];
	}
	T[n+1]=1;
	ROF(i,n,1)
	{
		K[i]=K[i+1],T[i]=T[i+1];
		if(b[i]==1) K[i]=(K[i]+a[i]*T[i])%mod;
		else T[i]=T[i]*b[i]%mod;
	}
	FOR(j,1,L-1) 
	{
		FOR(i,1,n)
		{
			if(i+(1<<j)-1>n) mx[j][i]=-infl;
			else
			{
				mx[j][i]=min(mx[j-1][i],mx[j-1][i+(1<<(j-1))]-sum[j-1][i]);
				sum[j][i]=sum[j-1][i]+sum[j-1][i+(1<<(j-1))];
			}
		}
	}
	while(q--)
	{
		int l,r;
		ll x;
		cin>>x>>l>>r;
		l++;
		while(l<=r&&x<=mod)
		{
			ROF(j,L-1,0)
			{
				if(l+(1<<j)-1<=r&&x<=mx[j][l])
				{
					x+=sum[j][l];
					l+=(1<<j);
				}
			}
			if(x>mod||l>r) break;
			x*=b[l];
			l++;
		}
		x%=mod;
		if(l<=r)
		{
			ll t=pw(T[r+1],mod-2);
			x=x*T[l]%mod*t%mod;
			x=(x+(K[l]-K[r+1]+mod)*t)%mod;
		}
		cout<<x<<endl;
	}
	
    return 0;
}