#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/segtree>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}


template<typename T>
class Cumsum{
    public:
    Cumsum(vector<T> v): v(v){
        n = v.size();
        v_cumsum = vector<T>(n+1, T(0));
        for(int i = 0; i < n; i++) v_cumsum[i+1] = v_cumsum[i]+v[i];
    }
    /**
     * v[l] + ... + v[r-1]
     */ 
    T sum(int l, int r){
        if(r <= l) return T(0);
        if(r > n) r = n;
        if(l < 0) l = 0;
        return v_cumsum[r]-v_cumsum[l];
    }
    private:
    int n;
    vector<T> v;
    vector<T> v_cumsum;
};

ll op(ll x, ll y){
    return x+y;
}

ll e(){
    return 0;
}

using Seg = atcoder::segtree<ll, op, e>;
using T = tuple<int, int, int>;

const int START_DEC = -10;
const int START_ZERO = -5;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<ll> a(n);
    vector<ll> t(n);
    for(int i = 0; i < n; i++) cin >> a[i] >> t[i];
    map<int, vector<T>> queries;
    int q; cin >> q;
    for(int i = 0; i < q; i++){
        int d, l, r; cin >> d >> l >> r; l--;
        queries[d].push_back(T(l, r, i));
    }
    for(int i = 0; i < n; i++){
        queries[t[i]].push_back(T(START_DEC, i, -1));
        queries[t[i]+a[i]].push_back(T(START_ZERO, i, -1));
    }
    Seg same(a);
    Seg dec(n);
    Seg dec_cnt(n);
    vector<ll> ret(q);
    for(auto [d, qs]: queries){
        sort(qs.begin(), qs.end());
        // cout << "=== " << d << endl;
        for(auto tup: qs){
            if(get<2>(tup) == -1){
                auto [tp, i, _] = tup;
                if(tp == START_DEC){
                    same.set(i, 0);
                    dec.set(i, a[i]+t[i]-1);
                    dec_cnt.set(i, 1);
                }else{
                    dec.set(i, 0);
                    dec_cnt.set(i, 0);
                }
            }else{
                auto [l, r, i] = tup;
                ll ans = same.prod(l, r);
                ans += dec.prod(l, r);
                ans -= dec_cnt.prod(l, r)*d;
                ret[i] = ans;
            }
        }
    }
    print_vector(ret, '\n');
}