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

struct Data{
	long long suf = -Inf64,pre = -Inf64,all = 0,max = -Inf64;
};

Data op(Data a,Data b){

	if(a.suf==-Inf64)return b;
	if(b.suf==-Inf64)return a;

	a.max = max({a.max,b.max,a.suf,b.suf,a.pre,b.pre,a.suf + b.pre});

	a.pre = max({a.all + b.pre,a.pre});

	a.suf = max({b.suf,a.suf + b.all});

	a.all += b.all;
	a.max = max({a.max,a.pre,a.suf,a.all});

	return a;
}

Data e(){
	return Data();
}

int main(){
	
	int N;
	cin>>N;
	
	vector<long long> ts(1,0);
	vector<long long> a(N),b(N);
	long long cur = 0;
	rep(i,N){
		cin>>a[i]>>b[i];
		cur += b[i];
		ts.push_back(cur);
	}
	int Q;
	cin>>Q;
	vector<long long> t(Q),x(Q),y(Q);
	rep(i,Q){
		cin>>t[i]>>x[i]>>y[i];
		x[i]--;
		if(t[i]==1){
			ts.push_back(x[i]);
			ts.push_back(x[i]+1);
		}
		else{
			ts.push_back(x[i]);
			ts.push_back(y[i]);
		}
	}
	sort(ts.begin(),ts.end());
	ts.erase(unique(ts.begin(),ts.end()),ts.end());
	cur = 0;
	segtree<Data,op,e> seg(ts.size());
	rep(i,N){
		long long l = distance(ts.begin(),lower_bound(ts.begin(),ts.end(),cur));
		
		while(ts[l]!=cur+b[i]){
			long long haba = ts[l+1] - ts[l];
			Data d;
			d.all = (long long)a[i] * haba;
			d.pre = max((long long)a[i],d.all);
			d.suf = max((long long)a[i],d.all);
			d.max = max(d.pre,d.suf);
			seg.set(l,d);
			l++;
		}
		cur += b[i];
	}
	/*cout<<"hoge"<<endl;
	rep(i,ts.size()-1){
		cout<<ts[0]<<','<<ts[i+1]<<','<<seg.prod(0,i+1).pre<<','<<seg.prod(0,i+1).suf<<','<<seg.prod(0,i+1).max<<endl;
		//return 0;
	}
	*/
	
	rep(i,Q){
		if(t[i]==1){
			int l = distance(ts.begin(),lower_bound(ts.begin(),ts.end(),x[i]));
			Data d;
			d.all = y[i] * 1;
			d.pre = max((long long)y[i],d.all);
			d.suf = max((long long)y[i],d.all);
			d.max = max(d.pre,d.suf);
			seg.set(l,d);
		}
		else{
			int l = distance(ts.begin(),lower_bound(ts.begin(),ts.end(),x[i]));
			int r = distance(ts.begin(),lower_bound(ts.begin(),ts.end(),y[i]));
			
			
			Data ans = seg.prod(l,r);
			cout<<ans.max<<endl;
		}
	}
	return 0;
}