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

using namespace std;
#define ll long long
#define vec vector

const int MOD = 1000000007;

struct imp {
  ll i, add, mul;
};

vec<vec<vec<imp>>> tree;

void qery(int dep, int v, int l, int r, int x, int y, vec<vec<imp>*> &out) {
  if (y < l or r < x or dep >= tree.size()) {
    return;
  }

  if (x <= l and r <= y) {
    out.push_back(&tree[dep][v]);
    return;
  }
  int mid = (l + r) / 2;
  qery(dep + 1, 2 * v, l, mid, x, y, out);
  qery(dep + 1, 2 * v + 1, mid + 1, r, x, y, out);

}

// 1
// 2 2
// 4 4 4 4
// 7 7 7 7 7 7 7

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n, q;
  cin >> n >> q;
  int m = 1;
  int ln = 0;
  while (m < n) {
    m *= 2;
    ln++;
  }
  tree.resize(ln + 1);

  vec<int> a(n);
  vec<int> b(n);
  for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
  for (int dep = ln; dep >= 0; dep--) {
    for (int start = 0; start < n; start += (1 << dep)) {
      vec<imp> imps;
      ll y = 0;
      ll add = 0;
      ll mul = 1;
      bool moded = false;
      for (int i = start; i < min(n, (start + (1 << dep))); i++) {
        if (a[i] + y > b[i] * y and b[i] > 1 and not moded) {
          imps.push_back({i, add, mul});
          y += a[i];
          add = 0;
          mul = 1;
        } else if (b[i] <= 1) {
          add += a[i];
          y += a[i];
        } else if (a[i] + y <= b[i] * y) {
          y *= b[i];
          add *= b[i];
          add %= MOD;
          mul *= b[i];
          mul %= MOD;
        }
        if (y > MOD) {
          moded = true;
          y %= MOD;
        }
      }
      imps.push_back({-1, add, mul});
      tree[ln - dep].push_back(imps);
    }
  }

  while (q--) {
    int l, r, x;
    cin >> x >> l >> r;
    vec<vec<imp>*> ress;
    qery(0, 0, 0, m - 1, l, r - 1, ress);
    ll res = x;
    bool moded = false;
    for (auto v : ress) {
      for (imp i : *v) {
        if (i.i == -1) {
          res *= i.mul;
          res %= MOD;
          res += i.add;
          res %= MOD;
        } else {
          res *= i.mul;
          if (res > MOD) {
            moded = true;
            res %= MOD;
          }

          res += i.add;
          if (res > MOD) {
            moded = true;
            res %= MOD;
          }

          if (!moded and a[i.i] + res > b[i.i] * res) {
            res += a[i.i];
          } else {
            res *= b[i.i];
          }

          if (res > MOD) {
            moded = true;
            res %= MOD;
          }
        }
      }
    }
    cout << res << "\n";
  }

  // while (q--) {
  //   int x; cin >> x;

  //   ll res = x;

  //   for (imp el: imps) {
  //     if (el.i == n) {
  //       res *= el.mul;
  //       res %= MOD;
  //       res += el.add;
  //       res %= MOD;
  //     } else {
  //       res *= el.mul;
  //       res %= MOD;
  //       res += el.add;
  //       res %= MOD;
  //       if (res + a[el.i] > res * b[el.i]) {
  //         res += a[el.i];
  //       } else {
  //         res *= b[el.i];
  //       }
  //       res %= MOD;
  //     }
  //   }
  //   cout << res << "\n";

  // }
}