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

#define int long long
const int MAX = 1 << 19;
const int mod = 1e9 + 7;
int a[MAX], b[MAX];

int pref[MAX];
int pos[MAX];

int sum(int l, int r)
{
  return pref[r] - pref[l - 1];
}

struct LinearOp
{
  int a, b;

  static LinearOp identity() { return {1, 0}; }

  static LinearOp compose(const LinearOp &first, const LinearOp &second)
  {
    return {(second.a * first.a) % mod, (second.a * first.b + second.b) % mod};
  }
};

class SegmentTree
{
  int n;
  std::vector<LinearOp> tree;

public:
  SegmentTree(int size) : n(size), tree(2 * size, LinearOp::identity()) {}

  void update(int i, LinearOp op)
  {
    i += n - 1;
    tree[i] = op;
    for (; i > 1; i >>= 1)
    {
      if (i & 1)
      {
        tree[i >> 1] = LinearOp::compose(tree[i ^ 1], tree[i]);
      }
      else
      {
        tree[i >> 1] = LinearOp::compose(tree[i], tree[i ^ 1]);
      }
    }
  }

  int query(int l, int r, int x)
  {
    LinearOp resL = LinearOp::identity();
    LinearOp resR = LinearOp::identity();
    for (l += n - 1, r += n; l < r; l >>= 1, r >>= 1)
    {
      if (l & 1)
        resL = LinearOp::compose(resL, tree[l++]);
      if (r & 1)
        resR = LinearOp::compose(tree[--r], resR);
    }
    LinearOp finalOp = LinearOp::compose(resL, resR);
    return (finalOp.a * (x % mod) + finalOp.b) % mod;
  }
};

void solve()
{
  int n, q;
  std::cin >> n >> q;
  for (int i = 1; i <= n; i++)
  {
    std::cin >> a[i];
    std::cin >> b[i];
    pref[i] = pref[i - 1] + a[i];
  }

  int last = n + 1;
  for (int i = n; i >= 1; i--)
  {
    if (b[i] != 1)
      last = i;
    pos[i] = last;
  }

  SegmentTree s(n);
  for (int i = 1; i <= n; i++)
  {
    if (b[i] == 1)
    {
      s.update(i, {1LL, a[i]});
    }
    else
    {
      s.update(i, {b[i], 0LL});
    }
  }

  // return;

  for (int i = 1; i <= q; i++)
  {
    int x, l, r;
    std::cin >> x >> l >> r;
    l++;
    while (true)
    {
      if (x > mod || l > r)
        break;
      int first_good = pos[l];

      if (first_good == l)
      {
        x = std::max(x + a[l], x * b[l]);
        l++;
        continue;
      }

      if (first_good > r)
      {
        x += sum(l, r);
        l = first_good;
        break;
      }
      else
      {
        x += sum(l, first_good - 1);
      }
      l = first_good;
    }

    x %= mod;

    if (l > r)
    {
      //  x %= mod;
      std::cout << x << "\n";
      continue;
    }
    else
    {
      // std::cout << "-1\n";
      std::cout << s.query(l, r, x) << "\n";
    }
  }
}

int32_t main()
{
  std::ios_base::sync_with_stdio(0);
  std::cin.tie(0);
  std::cout.tie(0);
  int testcases = 1;
  // std::cin >> testcases;
  while (testcases--)
  {
    solve();
  }
  return 0;
}