// Fabio Pettenuzzo VR363044 esercizio 2 dynArray

#include <cassert>
//#include <iostream>
#include <fstream>

using namespace std;

const int MAX_N = 100000;
int array[MAX_N][2];
int n,m,op,j,k;


/*void print(){
	cout<<endl<<"array0";
	int index=0;
	for(int i=1;i<=n;i++)cout <<"  "<< array[i][0];
	//while (index<n) { cout <<"  "<< array[index][0]; index++; }
	//for(int i=0;i<n;i++)cout <<" - "<< array[i][0];
	cout<<endl<<"array1";
	//while (index<n)     cout <<"  "<< array[index++][1];
	for(int i=1;i<=n;i++)cout <<"  "<< array[i][1];
}*/

int main(){
	ifstream fin("input.txt");
	assert(fin);

	fin>>n; fin>>m;
	ofstream fout("output.txt");
	
	for(int i=0;i<=n;i++)array[i][0]=array[i][1]=0;	
//print();
	for(int i=0;i<m;i++){
		fin>>op;
		if(op){ // operazione
			fin>>j;
			assert(j<=n);
			array[j][0]+=op;
			int t=j;
			while (t<=n){
				//cout<<t<<" < "<<n<<endl;
				assert(t<=n);
				array[t][1]+=op;
				t++;
			}
			/*for(int t=j; t++;t<n){
				cout<<t<<" < "<<n<<endl;
				assert(t<=n);
				array[t][1]+=op;
			}*/
			//print();
		}else{
			fin>>j>>k;
			assert(j<=n);
			assert(k<=n);

			fout << array[k][1]-array[j-1][1]<<" " ;
		}
	}
	fout.close();
}