////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// [Tips]
// XCode??§???EOF??\??????Ctrl+D
// ?\???Alt+\
// ans???????§?INT?????????2,147,483,647????¶????????????¨??????????????§long long?????£???????????????????????????
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////



////////////////////////////////////////
//RSQ (Range Sum Query)
//Solution 1.) Segment Tree
//Solution 2.) Binary Indexed Tree
////////////////////////////////////////

//#define debug //*******************************************************************************************************************************************
#ifdef debug
#include <chrono>
#endif

#include <iostream>
#include <algorithm> // next_permutation
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstring> //memcpy
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric> //accumulate
//#include <map>
//#include <unordered_map> //hash func.
#include <fstream> //ifstream, ofstream
#include <iterator> //insert_iterator::inserter


//#define NDEBUG //If NDEBUG is defined before #include <cassert>, assert will be ignored. You had better define NDEBUG when u submit the code.
#include <cassert> //assert

using namespace std;


#define dout cout
//If u wanna output to a text file instead of standard output, plz define OUTPUTFILE.
//#define OUTPUTFILE "output.txt" //*******************************************************************************************************************************************
#ifdef OUTPUTFILE
#define dout outputfile
ofstream outputfile(OUTPUTFILE);
#define OutputFilePath "/Users/Nag/Documents/Prgm/Test/DerivedData/Test/Build/Products/Debug/output.txt"
#endif


#define din cin
//If u wanna input from a text file instead of standard input, plz define INPUTFROMTEXTFILE???.
//#define INPUTFILE "input.txt" //*******************************************************************************************************************************************
#ifdef INPUTFILE
#define din inputfile
ifstream inputfile(INPUTFILE);
#endif

#define scand(A) scanf("%d", &(A))
#define scans(A) scanf("%s", (A))
#define disp(A) dout << #A << " = " << setw(3) << (A) << endl
#define disP(A) dout << setw(3) << (A) << " "
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define dispAll(A,n) dout << #A << " = "; rep(j, 0, (n)) {disP(A[j]);} dout << endl
//#define dispAll(A,n) cout << #A << " = "; rep(j, 0, (n)) {cout << setw(3) << A[j] << " ";} cout << endl

#define sign(x) ((x)>0)-((x)<0) //x<0: -1, x=0: 0, x>0: +1
#define p(i) ((i)/2)
#define l(i) ((i)*2)
#define r(i) ((i)*2+1)
#define sibling(i) (i^1) //the other sibling of i (ex. 16^1 = 17, 17^1 = 16)
#define isRightChild(i) (i&1) // ex. 16&1 = 0, 17&1 = 1
#define isLeftChild(i) (!(i&1)) // ex. 16&1 = 1, 17&1 = 0

int dx[] = {1,-1, 0, 0, 1, 1,-1,-1}; //???????????????????????????????¨??????????????????????????????????
int dy[] = {0, 0,-1, 1,-1, 1, 1,-1};

typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long ull;

const int INF = (1<<31)-1;
const ll INF_LL = (ll)9e18-1LL; //Be careful for overflow.
const ull INF_ULL = (ull)1e19-1ULL;
const int NONE = -1;
const ll MOD = (ll)1e9+7; //??§???????´???°?????£??¨??¨????????°????????????10???7??????

const int N_MAX = (1<<18); //num of vertex or element
const int M_MAX = 100010; //num of edge
const int DATA_MAX = 1010;

int N;
int a[N_MAX];
int BIT[N_MAX]; //Binary Indexed Tree

void init() {
//    fill(a, a+N_MAX, 0);
    fill(BIT, BIT+N_MAX, 0);
}



int rsq(int x, int y) {
    
#ifdef debug
    dout << "------ rsq( " << x << ", " << y << ")\n";
#endif
    
    assert(x<=y);
    assert(y<=N);
    
    int sum = 0;
    
    for(x+=(N-1), y+=(N-1); x<=y; x=p(x+1), y=p(y-1)) {
        if(isRightChild(x)) sum += a[x];
        if(isLeftChild(y)) sum += a[y];
    }
    
    return sum;
    
}


void add(int i, int x) {
#ifdef debug
    dout << "------ add( i=" << i << ", x=" << x << ")\n";
#endif
    
    for(i+=(N-1), a[i]+=x; i>1; i=p(i))
        a[p(i)] += x;
    
}



int sum_BIT(int i) { //sum of 1 ... i
    int sum = 0;
    for(; i>0; i-=(i&-i))
        sum += BIT[i];
    
    return sum;
}



int rsq_BIT(int x, int y) { //sum of x ... y
    
#ifdef debug
    dout << "------ rsq_BIT( " << x << ", " << y << ")\n";
#endif
    
    assert(x>=1);
    assert(x<=y);
    assert(y<=N);
    
    return sum_BIT(y) - sum_BIT(x-1); //x=1??§???sum_BIT(0)=0???????????£??????????????????
    
}


void add_BIT(int i, int x) {
#ifdef debug
    dout << "------ add_BIT( i=" << i << ", x=" << x << ")\n";
#endif
    
    for(; i<=N; i+=(i&-i))
        BIT[i] += x;
    
}



void display() {
#ifdef debug
    dout << "---------------------\n";
    dout << "i = ";
    rep(i,0,2*N) {
        disP(i);
    }
    dout << endl;
    dout << "a = ";
    rep(i,0,2*N) {
        disP(a[i]==INF?999:a[i]);
    }
    dout << endl;
    dout << "---------------------\n";
    dout << endl;
    
    dout << "---------------------\n";
    dout << "i = ";
    rep(i,0,N+1) {
        disP(i);
    }
    dout << endl;
    dout << "B = ";
    rep(i,0,N+1) {
        disP(BIT[i]==INF?999:BIT[i]);
    }
    dout << endl;
    dout << "---------------------\n";
    dout << endl;
#endif
}



int main() {
    
    //cin, cout????????????  ?????¨??????cin?????????????????¨??¨cin??§???scanf?????????????????¨??¨scanf??§??±?????????????????????
    cin.tie(0); //cin??¨cout??????????????????
    ios::sync_with_stdio(false); //iostream??¨stdio??????????????????
    
    //read input data
    scand(N);
    int Q; scand(Q);
    
    //------------------------------------------------------------------------------------------
#ifdef debug
    //start timer
    auto startTime = chrono::system_clock::now();
#endif
    //------------------------------------------------------------------------------------------
    
    init();
    display();
    
    int command, x, y;
    rep(i,0,Q) {
        scanf("%d%d%d", &command, &x, &y);
        
        if(command) {
//            printf("%d\n", rsq(x, y));
            printf("%d\n", rsq_BIT(x, y));
        }
        else {
//            add(x,y);
            add_BIT(x,y);
        }
        display();
    }
    
    
    
    
    //------------------------------------------------------------------------------------------
#ifdef debug
    //stop timer
    auto endTime = chrono::system_clock::now();
    auto dur = endTime - startTime;
    auto msec = chrono::duration_cast<chrono::milliseconds>(dur).count();
    dout << fixed << setprecision(4) << (double)msec/1000 << " sec \n";
#endif
    //------------------------------------------------------------------------------------------
    
#ifdef INPUTFILE
    inputfile.close();
#endif
    
#ifdef OUTPUTFILE
    outputfile.close();
    cout << "\"" << OutputFilePath << "\"" << endl;
#endif
    
    return 0;
}

Measured memory_bytes: 4240