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
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define vc vector
#define st first
#define nd second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)a.size()
#define pub push_back
#define pob pop_back
const ll MOD = 1e9 + 7;
ll md(ll x) {
	x %= MOD;
	if (x < 0)
		x += MOD;
	return x;
}

struct Tree {
	ll base;
	vc<ll> ta, tb;
	Tree() = default;
	Tree(vc<ll> &a, vc<ll> &b) {
		ll n = sz(a);
		base = 1;
		while (base < n)
			base *= 2;
		ta.assign(2 * base, 1);
		tb.assign(2 * base, 0);
		for (ll i = 0; i < n; i++)
			ta[i + base] = a[i];
		for (ll i = 0; i < n; i++)
			tb[i + base] = b[i];
		for (ll i = base - 1; i >= 1; i--) {
			ll li = 2 * i;
			ll ri = li + 1;
			ta[i] = md(ta[li] * ta[ri]);
			tb[i] = md(tb[li] * ta[ri] + tb[ri]);
		}
	}
	pll que(ll l, ll r) {
		l += base - 1;
		r += base + 1;
		pll ret = {1, 0};
		vc<pll> toa;
		while (l + 1 < r) {
			if (l % 2 == 0) {
				ret.nd = md(ret.nd * ta[l + 1] + tb[l + 1]);
				ret.st = md(ret.st * ta[l + 1]);
			}
			if (r % 2 == 1)
				toa.pub({ta[r - 1], tb[r - 1]});
			l /= 2;
			r /= 2;
		}
		reverse(all(toa));
		for (auto &[a, b] : toa) {
			ret.nd = md(ret.nd * a + b);
			ret.st = md(ret.st * a);
		}
		return ret;
	}
};

ll n, q;
vc<ll> a, b, pa, pb, psa;
Tree tree;

void input() {
	cin >> n >> q;
	a.resize(n);
	b.resize(n);
	for (ll i = 0; i < n; i++)
		cin >> a[i] >> b[i];
}

ll sum_a(ll l, ll r) {
	return psa[r + 1] - psa[l];
}

void prepro() {
	pa.resize(n + 1);
	pb.resize(n + 1);
	pa[n] = pb[n] = n;
	for (ll i = n - 1; i >= 0; i--) {
		if (a[i] > 0)
			pa[i] = i;
		else
			pa[i] = i + 1;
		if (b[i] > 1)
			pb[i] = i;
		else
			pb[i] = i + 1;
	}

	psa.assign(n + 1, 0);
	for (ll i = 1; i <= n; i++)
		psa[i] = psa[i - 1] + a[i - 1];
	
	vc<ll> c(n, 1), d(n, 0);
	for (ll i = 0; i < n; i++) {
		if (b[i] != 1)
			c[i] = b[i];
		else
			d[i] = a[i];
	}
	tree = Tree(c, d);
}

ll query(ll l, ll r, ll x) {
	if (x == 0) {
		l = pa[l];
		if (l > r)
			return x;
	}
	while (l <= r) {
		if (x >= MOD) {
			x = md(x);
			pll p = tree.que(l, r);
			x = md(p.st * x + p.nd);
			return x;
		}
		ll i = pb[l];
		i = min(i, r + 1);
		x += sum_a(l, i - 1);
		if (i > r)
			return md(x);
		x = max(x + a[i], x * b[i]);
		l = i + 1;
	}
	return md(x);
}

void program() {
	input();
	prepro();
	while (q--) {
		ll x, l, r;
		cin >> x >> l >> r;
		r--;
		cout << query(l, r, x) << "\n";
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	program();
	return 0;
}