#include <iostream>
#include <fstream>
#include <sstream>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <string>

//Matteo Cuccato vr366004

using namespace std;

#define MAX_N 100000
#define MAX_M 100000

int n;
int m;
int A[MAX_N+1];
int richieste[MAX_M+1];
string out=" ";
int sol[MAX_M+1];
int index=0;

int A_sp[MAX_N+1];

stringstream str;

void inc(int q,int pos){
	for(int i=pos;i<=n;i++)
		A_sp[i]=A_sp[i]+q;
}

void inc2(int q,int pos){
	A[pos]=A[pos]+q;
}

void display2(int inizio,int fine){
	
	sol[index]=A_sp[fine]-A_sp[inizio-1];
	index++;
}
void display(int inizio,int fine){
	str << "" << A_sp[fine]-A_sp[inizio-1] << " ";

}

int main(){
	//cout << "eseguo dynArray2" << endl;	

	ifstream fin("input0.txt");
	fin >> n; fin >> m;
	//cout << "n: " << n << ", m: " << m << endl;

	
	int q_m; int in; int f;
	for(int i=1;i<=m;i++){
		fin >> q_m;
		//cout << "q_m: " << q_m << endl;
		if(q_m == 0 ){
			fin >> in; fin >> f;
			//cout << "in: " << in <<", fin: "<< f << endl;
			display(in,f);
		}else{
			fin >> in;
			inc(q_m,in);
		}
		
	}

	

	ofstream fout("output.txt");
	/*for(int i=0;i<index;i++)
		fout << sol[i] << " ";
	*/
	fout << str.str();
	
	fout.close();	
	return(0);
}