#include<bits/stdc++.h>
using namespace std;
int n,m,a[500005],k,x,y,mod=0,b[500005]={0};
int main(){
	cin>>n>>m;
	int u;
	for(int i=1;i<=n;++i)cin>>a[i],mod+=a[i];
	while(m--){
		cin>>u;
		if(u==1){
			cin>>x>>k;
			for(int i=x;i<=n;++i)b[i]+=k;
		}
		if(u==2){
			cin>>x>>y;
			cout<<mod+b[y]-b[x-1];
		}
	}
	return 0;
}