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
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long ll;

vector <ll> a,b;

const ll MOD = 1000000007;

struct Node {
    ll granX;
    ll mnozMOD, dodMod;
    ll mnozBez, dodBez;
};

struct pyt {
    ll wynMOD;
    ll wynBez;
};

vector <Node> drzewo;

Node merge (Node &left, Node &right) {
    Node tym;
    tym.granX = max(left.granX,right.granX);
    tym.mnozMOD = (left.mnozMOD*right.mnozMOD)%MOD;
    tym.dodMod = (left.dodMod*right.mnozMOD+right.dodMod)%MOD;
    tym.mnozBez = left.mnozBez*right.mnozBez;
    if (tym.mnozBez > MOD) tym.mnozBez = MOD;
    tym.dodBez = left.dodBez*right.mnozBez+right.dodBez;
    if (tym.dodBez  > MOD) tym.dodBez = MOD;
    return tym;
}

void build(int rozm, int n) {
    for (int i = 0; i < n; i++) {
        int p = i + rozm;
        if (b[i] == 1) {
            drzewo[p].granX = -1;
            drzewo[p].mnozBez = drzewo[p].mnozMOD = 1;
            drzewo[p].dodMod = drzewo[p].dodBez = a[i];
        } else {
            int gran = -1;
            if (a[i] != 0) gran = (a[i]-1)/(b[i]-1);
            drzewo[p].granX = gran;
            drzewo[p].mnozMOD = drzewo[p].mnozBez = b[i];
            drzewo[p].dodMod = drzewo[p].dodBez = 0;
        }
    }
    //cout << rozm;
    for (int i = n; i < rozm; i++) {
        drzewo[i + rozm] = {-1, 1, 0, 1, 0};
    }
    for (int i = rozm - 1; i >= 1; i--) {
        drzewo[i] = merge(drzewo[2*i], drzewo[2*i+1]);
    }
}

void lazyNode (Node &tree, pyt&curr) {
    curr.wynMOD = (curr.wynMOD*tree.mnozMOD+tree.dodMod)%MOD;
    if (curr.wynBez != MOD) {
        ll tym = curr.wynBez*tree.mnozBez+tree.dodBez;
        if (tym >= MOD) curr.wynBez = MOD;
        else curr.wynBez = tym;
    }
}

void lazyLisc (Node &tree, pyt &curr, int p) {
    ll aCurr = a[p], bCurr = b[p];
    if (bCurr == 1) {
        curr.wynMOD = (curr.wynMOD+aCurr)%MOD;
        curr.wynBez = (curr.wynBez+aCurr);
        if (curr.wynBez > MOD) curr.wynBez = MOD;
        return;
    }
    int gran = -1;
    if (aCurr != 0) gran = (aCurr-1)/(bCurr-1);
    if (curr.wynBez == MOD || curr.wynBez > gran) {
        curr.wynMOD = (curr.wynMOD*bCurr)%MOD;
        curr.wynBez = curr.wynBez*bCurr;
        if (curr.wynBez > MOD) curr.wynBez = MOD;
    } else {
        curr.wynMOD = (curr.wynMOD+aCurr)%MOD;
        curr.wynBez = curr.wynBez+aCurr;
        if (curr.wynBez > MOD) curr.wynBez = MOD;
    }
    //cout << curr.wynBez << " " << curr.wynMOD << "\n";
}

void query (int p, int l, int r, int ql, int qr, pyt &curr, int &n) {
    if (l >= qr || r <= ql) return;
    if (l >= ql && r <= qr && (curr.wynBez == MOD || curr.wynBez > drzewo[p].granX)) {
        lazyNode(drzewo[p],curr);
        return;
    }
    if (r == l+1) {
        if (l < n) lazyLisc(drzewo[p],curr,l);
        return;
    }
    int mid = (l+r)/2;
    query(p*2,l,mid,ql,qr,curr,n);
    query(p*2+1,mid,r,ql,qr, curr,n);
}

int main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n,q;
    cin >> n >> q;
    a.resize(n);
    b.resize(n);
    int rozm = 1;
    while (rozm <= n) rozm*=2;
    drzewo.resize(2*rozm);
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
    }
    build(rozm,n);
    while (q--) {
        ll x,l,r;
        cin >> x >> l >> r;
        pyt tym = {x,x};
        query(1,0,rozm,l,r,tym,n);
        cout << tym.wynMOD%MOD << "\n";
    }
    return 0;
}