#include <bits/stdc++.h>
using namespace std;
template <typename T>
struct dual_invertible_binary_indexed_tree{
  int N;
  vector<T> BIT;
  function<T(T, T)> f;
  function<T(T)> inv;
  T E;
  dual_invertible_binary_indexed_tree(int N, function<T(T, T)> f, function<T(T)> inv, T E): N(N), BIT(N + 1, E), f(f), inv(inv), E(E){
  }
  void add(int i, T x){
    while (i > 0){
      BIT[i] = f(BIT[i], x);
      i -= i & -i;
    }
  }
  void add(int l, int r, T x){
    add(l, inv(x));
    add(r, x);
  }
  T operator [](int i){
    i++;
    T ans = E;
    while (i <= N){
      ans = f(ans, BIT[i]);
      i += i & -i;
    }
    return ans;
  }
};
int main(){
  int N;
  cin >> N;
  vector<int> A(N), T(N);
  for (int i = 0; i < N; i++){
    cin >> A[i] >> T[i];
  }
  int Q;
  cin >> Q;
  vector<int> D(Q), L(Q), R(Q);
  for (int i = 0; i < Q; i++){
    cin >> D[i] >> L[i] >> R[i];
    L[i]--;
  }
  vector<int> D2 = D;
  sort(D2.begin(), D2.end());
  D2.erase(unique(D2.begin(), D2.end()), D2.end());
  for (int i = 0; i < Q; i++){
    D[i] = lower_bound(D2.begin(), D2.end(), D[i]) - D2.begin();
  }
  int cnt = D2.size();
  vector<vector<int>> QL(N + 1), QR(N + 1);
  for (int i = 0; i < Q; i++){
    QL[L[i]].push_back(i);
    QR[R[i]].push_back(i);
  }
  vector<long long> ans(Q, 0);
  dual_invertible_binary_indexed_tree<int> BIT1(cnt, plus<int>(), negate<int>(), 0);
  dual_invertible_binary_indexed_tree<long long> BIT2(cnt, plus<long long>(), negate<long long>(), 0);
  for (int i = 0; i <= N; i++){
    for (int j : QL[i]){
      ans[j] -= (long long) BIT1[D[j]] * D2[D[j]] + BIT2[D[j]];
    }
    for (int j : QR[i]){
      ans[j] += (long long) BIT1[D[j]] * D2[D[j]] + BIT2[D[j]];
    }
    if (i < N){
      int p1 = lower_bound(D2.begin(), D2.end(), T[i]) - D2.begin();
      int p2 = lower_bound(D2.begin(), D2.end(), T[i] + A[i]) - D2.begin();
      BIT2.add(0, p1, A[i]);
      BIT1.add(p1, p2, -1);
      BIT2.add(p1, p2, A[i] + T[i] - 1);
    }
  }
  for (int i = 0; i < Q; i++){
    cout << ans[i] << endl;
  }
}