#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

template <typename Abelian>
struct FenwickTree {
  explicit FenwickTree(const int n, const Abelian ID = 0)
      : n(n), ID(ID), data(n, ID) {}

  void add(int idx, const Abelian val) {
    for (; idx < n; idx |= idx + 1) {
      data[idx] += val;
    }
  }

  Abelian sum(int idx) const {
    Abelian res = ID;
    for (--idx; idx >= 0; idx = (idx & (idx + 1)) - 1) {
      res += data[idx];
    }
    return res;
  }

  Abelian sum(const int left, const int right) const {
    return left < right ? sum(right) - sum(left) : ID;
  }

  Abelian operator[](const int idx) const { return sum(idx, idx + 1); }

  int lower_bound(Abelian val) const {
    if (val <= ID) return 0;
    int res = 0, exponent = 1;
    while (exponent <= n) exponent <<= 1;
    for (int mask = exponent >> 1; mask > 0; mask >>= 1) {
      const int idx = res + mask - 1;
      if (idx < n && data[idx] < val) {
        val -= data[idx];
        res += mask;
      }
    }
    return res;
  }

 private:
  const int n;
  const Abelian ID;
  std::vector<Abelian> data;
};

int main() {
  int n; cin >> n;
  FenwickTree<ll> bit(n);
  FenwickTree<int> num(n);
  vector<tuple<int, int, int>> queries;
  REP(i, n) {
    int a, t; cin >> a >> t;
    bit.add(i, a);
    queries.emplace_back(t, 0, i);
    queries.emplace_back(t + a, 1, i);
  }
  int q; cin >> q;
  vector<int> l(q), r(q);
  REP(i, q) {
    int d; cin >> d >> l[i] >> r[i]; --l[i]; --r[i];
    queries.emplace_back(d, 2, i);
  }
  sort(ALL(queries));
  vector<ll> ans(q);
  for (const auto& [d, type, i] : queries) {
    if (type == 0) {
      bit.add(i, d - 1);
      num.add(i, 1);
    } else if (type == 1) {
      bit.add(i, -bit[i]);
      num.add(i, -1);
    } else if (type == 2) {
      // cout << '[' << d << "]\n";
      // REP(j, n) cout << bit[j] << " \n"[j + 1 == n];
      // REP(j, n) cout << num[j] << " \n"[j + 1 == n];
      ans[i] = bit.sum(l[i], r[i] + 1) - 1LL * num.sum(l[i], r[i] + 1) * d;
    }
  }
  REP(i, q) cout << ans[i] << '\n';
  return 0;
}