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
#include <algorithm>
#include <iostream>
#include <vector>
#include <list>
#include <cassert>
using namespace std;

#define FOR(i, n) for (int i = 0, __n = (n); i < __n; i++)

#define LOG(x) ;

// using num = __int128;

const long long MOD = 1000000007;
const long long MOD2 = MOD * 2;

const int MAXN = 500000;
const int MAXQ = 100000;

int a[MAXN], b[MAXN];

long long MM(long long x) {
  if (x < MOD)
    return x;
  else
    return MOD + x % MOD;
}

// long long MUL(long long x, long long y) {
//   return ((num)x*(num)y) % (num)MOD;
// }

bool OF(long long x) {
  return x >= MOD;
}
struct Node {
  int l, r;
  Node *left, *right;

  long long sum;
  long long factor;
  long long factorsum;
  long long maxsum;

  void init(int, int);

  long long query(int ql, int qr, long long q) {
    LOG(
        static int depth = 0;
        FOR(i, depth) cerr << "  ";

    cerr << "q " << ql << " " << qr << " " << q << " in [" << this->l << ", " << this->r << ") sum=" << sum << " factor=" << factor << " factorsum=" << factorsum << " maxsum=" << maxsum << endl;
    )
    long long res;
    if (qr <= l || ql >= r) {
      LOG(
          FOR(i, depth) cerr << "  ";
          cerr << "query " << ql << " " << qr << " " << q << " in [" << this->l << ", " << this->r << ") q = " << q << endl;)
      return q;
    }

    if (ql <= l && qr >= r) {
      if (OF(q)) {
        LOG(
            FOR(i, depth) cerr << "  ";
            cerr << "query " << ql << " " << qr << " " << q << " in [" << this->l << ", " << this->r << ") *factor= " << MM(q * factor + factorsum) << endl;)
        return MM(q * factor + factorsum);
      }
      if (q <= maxsum) {
        LOG(
            FOR(i, depth) cerr << "  ";
            cerr << "query " << ql << " " << qr << " " << q << " in [" << this->l << ", " << this->r << ") q+sum= " << MM(q + sum) << endl;)
        return MM(q + sum);
      }
      if (!left) {
        LOG(
            FOR(i, depth) cerr << "  ";
            cerr << "query " << ql << " " << qr << " " << q << " in [" << this->l << ", " << this->r << ") max = " << MM(max(q * factor + factorsum, q + sum)) << endl;)
        return MM(max(q * factor + factorsum, q + sum));
      }
    }
    LOG(depth++;)
    long long q1 = left->query(ql, qr, q);
    long long q2 = right->query(ql, qr, q1);
    LOG(
        depth--;
        FOR(i, depth) cerr << "  ";
        cerr << "query " << ql << " " << qr << " " << q << " in [" << this->l << ", " << this->r << ") q2 = " << q2 << endl;)
    return q2;
  }
}
Nodes[MAXN * 2+1];
static int nodecnt = 0;

void Node::init(int pl, int pr) { 
  l = pl;
  r = pr;
  left = right = nullptr;
  if (l + 1 < r) {
    int m = (l + r) / 2;
    left = &Nodes[nodecnt++];
    right = &Nodes[nodecnt++];
    left->init(l, m);
    right->init(m, r);

    sum = MM(left->sum + right->sum);
    factor = MM(left->factor * right->factor);
    factorsum = MM(left->factorsum * right->factor + right->factorsum);

    if (OF(left->sum) || OF(right->sum) || right->maxsum < left->sum) {
      maxsum = -1;
    } else {
      maxsum = min(left->maxsum, right->maxsum - left->sum);
    }
  } else {
    sum = a[l];
    factor = b[l];
    if (factor == 1) {
      factorsum = a[l];
      maxsum = MOD - 1;
    } else {
      factorsum = 0;
      maxsum = sum / (factor - 1);
    }
  }

  LOG(
      cerr << "Node [" << l << ", " << r << "): sum=" << sum << " factor=" << factor << " factorsum=" << factorsum << " maxsum=" << maxsum << endl;)
  }

int main() {
  int n, q;
  scanf("%d%d", &n, &q);

  FOR(i, n) {
    scanf("%d%d", &a[i], &b[i]);
  }
  Node *root = &Nodes[nodecnt++];
  root->init(0, n);
// return 0;
  FOR(i, q) {
    int x, l, r;
    scanf("%d%d%d", &x, &l, &r);

    long long res = root->query(l, r, x) % MOD;
    printf("%lld\n", res);
  }

  // cerr << nodecnt << " nodes used" << endl;
  return 0;
}