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

using ll = long long;
const ll MOD = 1e9+7;

struct Line {
    ll k, m; // y = kx + m (BEZ MODA!)
};

__int128 eval128(const Line &l, ll x) {
    return (__int128)l.k * x + l.m;
}

ll eval(const Line &l, ll x) {
    return ( ( (__int128)l.k * x + l.m ) % MOD );
}

bool bad(const Line &l1, const Line &l2, const Line &l3) {
    return (__int128)(l2.m - l1.m) * (l1.k - l3.k)
         >= (__int128)(l3.m - l1.m) * (l1.k - l2.k);
}

vector<Line> hull(vector<Line> v) {
    sort(v.begin(), v.end(), [](auto &a, auto &b) {
        if (a.k != b.k) return a.k < b.k;
        return a.m < b.m;
    });

    vector<Line> res;
    for (auto &l : v) {
        if (!res.empty() && res.back().k == l.k) {
            if (res.back().m >= l.m) continue;
            res.pop_back();
        }
        while (res.size() >= 2 && bad(res[res.size()-2], res.back(), l))
            res.pop_back();
        res.push_back(l);
    }
    return res;
}

vector<Line> merge(const vector<Line> &L, const vector<Line> &R) {
    vector<Line> res;
    for (auto &l : L) {
        for (auto &r : R) {
            // r(l(x)) = r.k * (l.k*x + l.m) + r.m
            ll nk = r.k * l.k;
            ll nm = r.k * l.m + r.m;
            res.push_back({nk, nm});
        }
    }
    return hull(res);
}

int n, q;
vector<pair<ll,ll>> a;
vector<vector<Line>> seg;

void build(int v, int l, int r) {
    if (l == r) {
        ll A = a[l].first;
        ll B = a[l].second;
        seg[v] = hull({
            {1, A},
            {B, 0}
        });
        return;
    }
    int m = (l+r)/2;
    build(v*2, l, m);
    build(v*2+1, m+1, r);
    seg[v] = merge(seg[v*2], seg[v*2+1]);
}

vector<Line> query(int v, int l, int r, int ql, int qr) {
    if (ql <= l && r <= qr) return seg[v];
    int m = (l+r)/2;
    if (qr <= m) return query(v*2, l, m, ql, qr);
    if (ql > m) return query(v*2+1, m+1, r, ql, qr);
    return merge(
        query(v*2, l, m, ql, qr),
        query(v*2+1, m+1, r, ql, qr)
    );
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n >> q;
    a.resize(n+1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i].first >> a[i].second;
    }

    seg.resize(4*n);
    build(1, 1, n);

    while (q--) {
        ll x;
        int l, r;
        cin >> x >> l >> r;

        auto lines = query(1, 1, n, l, r);

        __int128 best = 0;
        for (auto &ln : lines) {
            best = max(best, eval128(ln, x));
        }

        cout << (ll)(best % MOD) << "\n";
    }
}