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

typedef long long ll;
typedef short int sint;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<sint, sint> pss;
typedef vector<ll> vll;
typedef vector<int> vint;
typedef vector<sint> vsint;
typedef vector<char> vchar;
typedef vector<bool> vbool;
typedef vector<vbool> vvbool;
typedef vector<vll> vvll;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
typedef vector<pss> vpss;
typedef vector<ull> vull;
typedef vector<vint> vvint;
typedef vector<vvint> vvvint;
typedef vector<vchar> vvchar;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;

#define rep(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define res(i, m, n) for (int i = (int)(m); i >= (int)(n); --i)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define all1(x) (x).begin()+1, (x).end()

struct st{
    ll x, l, r;
};

struct korzen{
    ll a = 1, b = 0;
};

vector<korzen> drzewo;
int p2 = 4;

constexpr ll mod = 1e9+7;
constexpr int trzydziescidwa = 32;

ll n, q;
vector<korzen> p;
vint ans;
vector<st> querrrrrry;

korzen mergeee(korzen a, korzen b)
{
    a.a = (a.a * b.a) % mod;
    a.b = (a.b * b.a + b.b) % mod;
    return a;
}

void wczytaj()
{
    cin >> n >> q;

    p.resize(n+69);
    while(p2 <= n)
        p2 *= 2;
    drzewo.resize(n*2+69);
    querrrrrry.push_back({0,0,0});

    rep(i,1,n)
    {
        cin >> p[i].b >> p[i].a;
        drzewo[p2 + i - 1] = p[i];
    }
    ll x, l, r;
    rep(i,1,q)
    {
        cin >> x >> l >> r;
        querrrrrry.push_back({x, l, r});
    }

    res(i,p2-1, 1)
        drzewo[i] = mergeee(drzewo[i*2], drzewo[i*2+1]);
}

korzen querry(int v, int l, int r, int L, int R)
{
    if (l > r || l > R || r < L)
        return {1,0};
    if (L <= l && r <= R)
        return drzewo[v];
    int mid = (l + r) / 2;
    korzen tmp;
    if (L <= mid)
        tmp = mergeee(tmp, querry(v * 2, l, r, L, R));
    if (R >= mid + 1)
        tmp = mergeee(tmp, querry(v*2+1, mid+1, r, L, R));
    return tmp;
}

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

    wczytaj();

    rep(i,1,q)
    {
        auto[x,l,r] = querrrrrry[i];
        ++l;
        rep(j,l,min(r, l+trzydziescidwa-1))
        {
            if (x * p[j].a - x > p[j].b)
                x *= p[j].a;
            else
                x += p[j].b;
            x %= mod;
        }

        l += trzydziescidwa;

        if (l > r)
        {
            cout /*<< "GRANDE ABSENTE vol 69"*/ << x << '\n';
            continue;
        }

        korzen xxx = querry(1, 1, p2, l, r);
        x = (x * xxx.a + xxx.b) % mod;

        cout << x << '\n';
    }

    return 0;
}