#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

struct S { ll a, b; };
S op(S x, S y) { return {x.a + y.a, x.b + y.b}; }
S e() { return {0, 0}; }

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI a(n), t(n);
  vector<tuple<int, int, int, int>> qs;
  vector<S> init(n);
  rep(i, n) {
    int a, t;
    cin >> a >> t;
    init[i] = {0, a};
    qs.emplace_back(t, -n + i, a, 0);
    qs.emplace_back(t + a, -n + i, a, 0);
  }
  segtree<S, op, e> seg(init);
  int q;
  cin >> q;
  rep(i, q) {
    int d, l, r;
    cin >> d >> l >> r;
    l--;
    qs.emplace_back(d, i, l, r);
  }
  sort(all(qs));
  VL ans(q);
  for(auto [t, i, l, r]: qs) {
    if (i < 0) {
      i += n;
      if (seg.get(i).a == 0) seg.set(i, {-1, t + l - 1});
      else seg.set(i, {0, 0});
    } else {
      auto [a, b] = seg.prod(l, r);
      ans[i] = a * t + b;
    }
  }
  for(ll x: ans) cout << x << '\n';
}