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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
#include <iostream>
#include <vector>

using int64 = long long int;

const int64 MOD = 1000000007;
int n, q;

struct event_t
{
	int add;
	int mult;
};
std::vector<event_t> events;

struct segment_tree_entry_t
{
	int64 add;
	int64 mult;

	static segment_tree_entry_t join(const segment_tree_entry_t& left, const segment_tree_entry_t& right)
	{
		return { (left.add * right.mult + right.add) % MOD, (left.mult * right.mult) % MOD };
	}
};
std::vector<segment_tree_entry_t> segment_tree;
int segment_tree_pow;

void build_segment_tree()
{
	segment_tree_pow = 1;
	while (segment_tree_pow < n)
		segment_tree_pow *= 2;
	segment_tree.resize(segment_tree_pow * 2, {0, 1});
	for (int i = 0; i < n; ++i)
		segment_tree[segment_tree_pow + i] = events[i].mult >= 2 ? segment_tree_entry_t{0, events[i].mult} : segment_tree_entry_t{events[i].add, 1};
	for (int i = n - 1; i >= 1; --i)
		segment_tree[i] = segment_tree_entry_t::join(segment_tree[i << 1], segment_tree[(i << 1) + 1]);
}

int64 query_segment_tree(int64 x, int l, int r)
{
	l += segment_tree_pow;
	r += segment_tree_pow;
	segment_tree_entry_t left = {0, 1};
	segment_tree_entry_t right = {0, 1};
	while (l <= r)
	{
		if (l & 1)
		{
			left = segment_tree_entry_t::join(left, segment_tree[l]);
			++l;
		}
		if (!(r & 1))
		{
			right = segment_tree_entry_t::join(segment_tree[r], right);
			--r;
		}
		l >>= 1;
		r >>= 1;
	}
	const segment_tree_entry_t final_op = segment_tree_entry_t::join(left, right);
	return (final_op.add + x * final_op.mult) % MOD;
}

struct prefix_sum_entry_t
{
	int64 sum = -1;
	int start;
	int end;
};
std::vector<prefix_sum_entry_t> prefix_sums;

void build_prefix_sums()
{
	for (int i = 0; i < n; ++i)
	{
		int start = i;
		int end = i;
		while (end < n && events[end].mult == 1)
			++end;
		int64 sum = 0;
		for (int j = start; j < end; ++j)
		{
			sum = (sum + events[j].add) % MOD;
			prefix_sums[j].sum = sum;
			prefix_sums[j].start = start;
			prefix_sums[j].end = end;
		}
		if (start < end)
			i = end - 1;
	}
}

int main()
{
	std::cin >> n >> q;
	events.resize(n);
	for (int i = 0; i < n; ++i)
		std::cin >> events[i].add >> events[i].mult;
	build_segment_tree();
	prefix_sums.resize(n);
	build_prefix_sums();
	for (int i = 0; i < q; ++i)
	{
		int64 x;
		int l, r;
		std::cin >> x >> l >> r;
		bool x_larger_than_mod = false;
		for (int j = l; j < r; ++j)
		{
			if (x_larger_than_mod)
			{
				x = query_segment_tree(x, j, r - 1);
				break;
			}
			else
			{
				const event_t& event = events[j];
				const prefix_sum_entry_t& prefix_sum_entry = prefix_sums[j];
				if (prefix_sum_entry.sum == -1)
				{
					const int64 x_added = x + event.add;
					const int64 x_multiplied = x * event.mult;
					x = (x_added > x_multiplied) ? x_added : x_multiplied;
					if (x >= MOD)
					{
						x = x % MOD;
						x_larger_than_mod = true;
					}
				}
				else
				{
					const int end = prefix_sum_entry.end < r ? prefix_sum_entry.end : r;
					const prefix_sum_entry_t& end_prefix_sum_entry = prefix_sums[end - 1];
					x += end_prefix_sum_entry.sum - prefix_sum_entry.sum + event.add;
					if (x >= MOD)
					{
						x = x % MOD;
						x_larger_than_mod = true;
					}
					j = end - 1;
				}
			}
		}
		std::cout << x << std::endl;
	}
	return 0;
}
/*

10 1
3 2
3 2
3 2
0 1000
0 1000
0 1000
0 1000
0 1000
0 1000
123 1
1 3 9


10 2
3 2
3 2
3 2
0 1000
0 1000
0 1000
0 1000
0 1000
0 1000
123 1
1 0 3
1 3 9

8 1
3 2
3 1
2 1
1 1
2 2
1 1
1 1
1 2
1 0 1

*/