#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 2000000000000000001
using P = pair<long long,long long>;

P op(P a,P b){
	auto ret = make_pair(0,0);
	ret.first = a.first + b.first;
	ret.second = a.second + b.second;
	return ret;
}

P e(){
	return make_pair(0LL,0LL);
}

P mapping(P a,long long b){
	a.first += b * a.second;
	return a;
}

long long composition(long long a,long long b){
	return a+b;
}

long long id(){
	return 0;
}

int main(){
	
	int n;
	cin>>n;
	
	map<long long,vector<int>> Add,Del;// Add(200005),Del(200005);
	fenwick_tree<long long> S(n+1),C(n+1);
	vector<long long> a(n),t(n);
	vector<long long> ts;
	rep(i,n){
	
		cin>>a[i]>>t[i];
		S.add(i,a[i]);
		
		Add[t[i]].push_back(i);
		
		
		Del[t[i]+a[i]].push_back(i);
		ts.push_back(t[i]);
		ts.push_back(t[i]+a[i]);
	}
	int q;
	cin>>q;
	vector<int> d(q),l(q),r(q);
	//vector<vector<int>> Qs(200005);
	map<long long,vector<int>> Qs;
	
	rep(i,q){
		cin>>d[i]>>l[i]>>r[i];
		l[i]--;
		Qs[d[i]].push_back(i);
		ts.push_back(d[i]);
	}
	sort(ts.begin(),ts.end());
	ts.erase(unique(ts.begin(),ts.end()),ts.end());
	vector<long long> ans(q);
	
	rep(i,ts.size()){
		rep(j,Add[ts[i]].size()){
			int ii = Add[ts[i]][j];
			S.add(ii,ts[i]-1);
			C.add(ii,1);
		}
		rep(j,Del[ts[i]].size()){
			int ii = Del[ts[i]][j];
			S.add(ii,-S.sum(ii,ii+1));
			C.add(ii,-C.sum(ii,ii+1));
		}
		rep(j,Qs[ts[i]].size()){
			int ii = Qs[ts[i]][j];
			long long tt = 0;
			tt += S.sum(l[ii],r[ii]);
			tt -= C.sum(l[ii],r[ii]) * (long long)ts[i];
			ans[ii] = tt;
		}
		
		
	}
	
	rep(i,q){
		cout<<ans[i]<<endl;
	}
	
	
	return 0;
}