#include<bits/stdc++.h>

using namespace std;
using ll=long long;

// マクロの定義
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define elif else if
#define unless(cond) if (!(cond))

// オーバーロードマクロ
#define overload2(_1, _2, name, ...) name
#define overload3(_1, _2, _3, name, ...) name
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload5(_1, _2, _3, _4, _5, name, ...) name

// 繰り返し系
#define rep1(n) for (ll i=0; i<n; i++)
#define rep2(i,n) for (ll i=0; i<n; i++)
#define rep3(i,a,b) for (ll i=a; i<b; i++)
#define rep4(i,a,b,c) for (ll i=a; i<b; i+=c)
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)

#define foreach1(x,a) for (auto &&x: a)
#define foreach2(x,y,a) for (auto &&[x,y]: a)
#define foreach3(x,y,z,a) for (auto &&[x,y,z]: a)
#define foreach4(x,y,z,w,a) for (auto &&[x,y,z,w]: a)
#define foreach(...) overload5(__VA_ARGS__,foreach4,foreach3,foreach2,foreach1)(__VA_ARGS__)

// 除算に関する関数
template<typename T, typename U>
T floor(T x, U y){return (x>0 ? x/y: (x-y+1)/y);}

template<typename T, typename U>
T ceil(T x, U y){return (x>0 ? (x+y-1)/y: x/y);}

template<typename T, typename U>
T mod(T x, U y){
    T q=floor(x,y);
    return x-q*y;
}

template<typename T, typename U>
pair<T,T> divmod(T x, U y){
    T q=floor(x,y);
    return {q,x-q*y};
}

// 指数に関する関数
ll intpow(ll x, ll y){
    ll a=1;
    while (y){
        if (y&1) a*=x;
        x*=x;
        y>>=1;
    }
    return a;
}

ll modpow(ll x, ll y, ll z){
    ll a=1;
    while (y){
        if (y&1) (a*=x)%=z;
        (x*=x)%=z;
        y>>=1;
    }
    return a;
}

ll sum(vector<int> &X){
    ll y=0;
    for (auto &&x: X) y+=x;
    return y;
}

template<typename T>
T sum(vector<T> &X){
    T y=T(0);
    for (auto &&x: X) y+=x;
    return y;
}

// max, min
template<typename T, typename U>
inline bool chmax(T &a, const U b){
    return (a<b ? a=b, 1: 0);
}

template<typename T, typename U>
inline bool chmin(T &a, const U b){
    return (a>b ? a=b, 1: 0);
}

template<class... T>
constexpr auto max(T... a){
    return max(initializer_list<common_type_t<T...>>{a...});
}
template<class... T>
constexpr auto min(T... a){
    return min(initializer_list<common_type_t<T...>>{a...});
}

template<class T>
T max(vector<T> X){
    T alpha=X[0];
    for (auto x:X) chmax(alpha, x);
    return alpha;
}

template<class T>
T min(vector<T> X){
    T alpha=X[0];
    for (auto x:X) chmin(alpha, x);
    return alpha;
}

// 入出力
template<class... T>
void input(T&... a){(cin >> ... >> a);}

void print(){cout << "\n";}

template<class T, class... Ts>
void print(const T& a, const Ts&... b){
    cout << a;
    (cout << ... << (cout << " ", b));
    cout << "\n";
}

template<typename T, typename U>
istream &operator>>(istream &is, pair<T,U> &P){
    is >> P.first >> P.second;
    return is;
}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T,U> &P){
    os << P.first << " " << P.second;
    return os;
}

template<typename T>
vector<T> vector_input(int N, int index){
    vector<T> X(N+index);
    for (int i=index; i<index+N; i++) cin >> X[i];
    return X;
}

template<typename T>
istream &operator>>(istream &is, vector<T> &X){
    for (auto &x: X) is >> x;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &X){
    int N=(int)len(X);
    rep(i,N) os << (i ? " ": "") << X[i];
    return os;
}

template<typename G>
struct Binary_Indexed_Tree{
    int n,log_n,index;
    vector<G> data;
    G unit;
    const function<G(G,G)> calc;
    const function<G(G)> inv;

    // 初期化
    public:
    Binary_Indexed_Tree(int n, const function<G(G,G)> calc, const G unit, const function<G(G)> inv, const int index):
        n(n), calc(calc), unit(unit), inv(inv), index(index){
        data.assign(n+1,unit);

        log_n=0;
        for (; 1<<(log_n+1)<=n; log_n++){}
    }

    public:
    Binary_Indexed_Tree(const vector<G> &vec, const function<G(G,G)> calc, const G unit, const function<G(G)> inv, const int index):
        Binary_Indexed_Tree(vec.size(), calc, unit, inv, index){
            for (int k=1; k<=n; k++){
                data[k]=calc(data[k],vec[k-1]);
                int l=k+(k&(-k));
                if (l<=n) data[l]=calc(data[l], data[k]);
            }
        }
    // 第 k 要素に x を左から加える.
    void add(int k, G x){
        k+=1-index;
        for (k; k<=n; k+=(k&(-k))) data[k]=calc(data[k], x);
    }

    // 第 k 要素を x に変更する.
    void update(int k ,G x){
        add(k, calc(inv((*this)[k]), x));
    }

    // 右半開区間 [index, k) における総和を求める.
    G sum(int k) const{
        k+=-index;
        if (k<=0) return unit;

        G y=unit;
        for (k; k>0; k-=(k&(-k))) y=calc(y, data[k]);

        return y;
    }

    // 右半開区間 [l, r) における総和を求める.
    G sum(int l, int r) const{
        if (l>=r) return unit;
        else return calc(inv(sum(l)),sum(r));
    }

    // 第 k 要素を取得する.
    inline G operator[](int k) const {return sum(k,k+1);}

    int binary_search(function<bool(int)> cond){
        if (cond(unit)) {return index-1;}

        int j=0, t=1<<log_n;
    }
};

int main(){
    // 入力
    int N; input(N);
    vector<ll> A(N), T(N);
    rep(i,N) input(A[i],T[i]);

    int Q; input(Q);
    vector<ll> D(Q), L(Q), R(Q);
    for (int q=0; q<Q; q++){
        input(D[q], L[q], R[q]);
        L[q]--; R[q]--;
    }

    // 準備
    using G=pair<ll,int>;
    vector<G> Query(Q);
    for (int q=0; q<Q; q++) Query[q]={D[q],q};
    sort(all(Query));

    priority_queue<G,vector<G>, greater<G>> E;
    for (int i=0; i<N; i++) E.push({T[i],i});

    auto add=[](G x, G y) -> G{
		return {x.first+y.first, x.second+y.second};
	};

    auto neg=[](G x) -> G{
        return {-x.first, -x.second};
    };

    Binary_Indexed_Tree<G> B(N,add,{0,0},neg,0);

    for (int i=0; i<N; i++) B.add(i, {A[i], 0});

    vector<ll> ans(Q);
    vector<bool> mode(N);

    for(G query: Query){
        ll d; int q;
        tie (d,q)=query;
        while (!E.empty() && E.top().first<=D[q]){
            ll a; int i;
            tie (a,i)=E.top(); E.pop();

            if (mode[i]==0){
                B.update(i, {A[i]+T[i]-1, -1});
                E.push({A[i]+T[i], i});
            }else{
                B.update(i, {0,0});
            }

            mode[i]=true;
        }

        ll alpha,beta;
        tie (alpha, beta)=B.sum(L[q],R[q]+1);
        ans[q]=alpha+beta*D[q];
    }

    for (int q=0; q<Q; q++) print(ans[q]);
}