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
#include <bits/stdc++.h>
using namespace std;
long long int mod=1e9+7;
long long int powe(long long int a, int p)
{
	if(p==0)
		return 1ll;
	if(p%2==1)
		return (a*powe(a,p-1))%mod;
	auto b=powe(a,p/2);
	b*=b;
	b%=mod;
	return b;
}
int main()
{
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);
	cout.tie(NULL);
	int n,q;
	cin>>n>>q;
	vector<long long int>a(n),b(n);
	for(int i=0 ;i<n; i++)
		cin>>a[i]>>b[i];
	vector<int>nast(n+1);
	nast[n-1]=n;
	for(int i=n-2; i>=0; i--)
	{
		nast[i]=nast[i+1];
		if(b[i+1]!=1)
			nast[i]=i+1;
	}
	vector<long long int>sm(n+1);
	for(int i=0; i<n; i++)
		sm[i+1]=sm[i]+a[i];
	vector<long long int>sufm(n+1),suf(n+1);
	sufm[n]=1;
	for(int i=n-1; i>=0; i--)
	{
		sufm[i]=sufm[i+1];
		suf[i]=suf[i+1];
		if(b[i]>1)
			sufm[i]=(sufm[i]*b[i])%mod;
		else
			suf[i]=(suf[i]+(a[i]*sufm[i+1]%mod))%mod;
	}
	for(int ij=0; ij<q; ij++)
	{
		long long int x;
		int l,r;
		cin>>x>>l>>r;
		int sf=n;
		while(l<r)
		{
			if(x+a[l]>x*b[l])
				x+=a[l];
			else
				x*=b[l];
			if(x>mod)
			{
				x%=mod;
				sf=l+1;
				break;
			}
			else
			{
				int ns=nast[l];
				if(ns>=r)
				{
					x+=(mod+sm[r]-sm[l+1]);
					x%=mod;
					break;
				}
				x+=(sm[ns]-sm[l+1]);
				if(x>mod)
				{
					x%=mod;
					sf=ns;
					break;
				}
				l=ns;
			}
			//cout<<"x="<<x<<"\n";
		}
		if(sf!=n)
		{
			long long int h=powe(sufm[r],mod-2);
			x=((x*sufm[sf]%mod)*h)%mod;
			x=(x+(((mod+suf[sf]-suf[r])%mod)*h%mod))%mod;
		}
		cout<<x<<"\n";
	}
}