#include<bits/stdc++.h>
using namespace std;
int n,a[50001],q,op,l,r,k,b[50001],cnt;
long long sum;
int main(){
	freopen("hod.in","r",stdin);
	freopen("hod.out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i];
	cin>>q;
	while(q--){
		cin>>op>>l>>r;
		if(op==1){
			for(int i=1;i<=r;i++) b[++cnt]=a[i];
			sort(b+1,b+cnt+1);
			for(int i=1;i<=r;i++){
				if(i<=l) sum+=a[i];
				else{
					if(a[i]<0) break;
					sum+=a[i];
				}
			}
			cout<<sum<<endl;
			memset(b,0,sizeof(b));
			cnt=0;
			sum=0;
		}else{
			cin>>k;
			for(int i=l;i<=r;i++) a[i]+=k;
		}
	}
	return 0;
}