#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<long long,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long op(long long a, long long b) { return a + b; }
long long e() { return 0; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<long long>a(n), t(n);
	vector<P>eve;
	rep(i, n) {
		cin >> a[i] >> t[i];
		eve.push_back({ 0 + t[i] * 3 ,i });
		long long t0 = a[i] + t[i];
		eve.push_back({ 1 + t0 * 3 ,i });
	}
	int q; cin >> q;
	vector<long long>d(q), l(q), r(q);
	rep(i, q) {
		cin >> d[i] >> l[i] >> r[i];
		l[i]--; r[i]--;
		eve.push_back({ 2 + d[i] * 3 ,i });
	}
	sort(all(eve));
	segtree<long long, op, e>seg0(a);
	segtree<long long, op, e>seg1(n);
	vector<long long>ans(q);
	rep(i, eve.size()) {
		auto[time, idx] = eve[i];
		if (0 == time % 3) {
			long long val = a[idx] + t[idx] - 1;
			seg0.set(idx, val);
			seg1.set(idx, 1);
		}
		else if (1 == time % 3) {
			seg0.set(idx, 0);
			seg1.set(idx, 0);
		}
		else {
			auto get0 = seg0.prod(l[idx], r[idx] + 1);
			auto get1 = seg1.prod(l[idx], r[idx] + 1);
			ans[idx] = get0;
			time /= 3;
			ans[idx] -= get1 * time;
		}
	}
	rep(i, q)cout << ans[i] << endl;
	return 0;
}