#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 100000000
#define INF 300000000000000000
#define MOD 1000000007
#define mod 1000000007
#define INT_MAX_ 2147483647
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[5]={-1,0,1,0,0};
int dy[5]={0,-1,0,1,0};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp1(pair<ll,ll>a,pair<ll,ll> b){
        if(a.se!=b.se)
        return a.se<b.se;
        else
        return a.fi<b.fi;
}
//----------------------------------------------------------------------
const ll MAX_N=1<<17;
ll nn,dat[4*MAX_N];
void init(ll n_){
    nn=1;
    while(nn<n_)
        nn*=2;
    //for(ll i=0;i<2*nn-1;i++)
        //dat[i]=INT_MAX_;
}
void update(ll k,ll a){
    k+=nn-1;
    dat[k]=a;
    while(k){
        k=(k-1)/2;
        dat[k]=mmin(dat[k*2+1],dat[k*2+2]);
    }
}
void add(ll k,ll a){
    k+=nn-1;
    dat[k]+=a;
    while(k){
        k=(k-1)/2;
        dat[k]=dat[k*2+1]+dat[k*2+2];
    }
}
ll getSum(ll a,ll b,ll k,ll l, ll r){
     if(r<=a||b<=l)return 0;
     if(a<=l&&b>=r)return dat[k];
     return getSum(a,b,k*2+1,l,(l+r)/2)+getSum(a,b,k*2+2,(l+r)/2,r);
}
ll getMin(ll a,ll b,ll k,ll l, ll r){
    if(r<=a||b<=l)return INT_MAX_;
    if(a<=l&&b>=r)return dat[k];
    ll vl=getMin(a,b,k*2+1,l,(l+r)/2);
    ll vr=getMin(a,b,k*2+2,(l+r)/2,r);
    return mmin(vl,vr);
}
//----------------------------------------------------------------------
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------  
    //ll begin_time=clock();
    //-------------------------------
    ll n,q;cin>>n>>q;
    init(n);
    for(ll i=0;i<q;i++){
        ll co,x,y;cin>>co>>x>>y;
        if(co==1){
            x--;y--;
            cout<<getSum(x,y+1,0,0,nn)<<endl;
        }  
        else{
            x--;
            add(x,y);
        }
    }
    //-------------------------------  
    //ll end_time=clock();cout<<"time="<<end_time-begin_time<<"ms"<<endl;
    //-------------------------------
    return 0;
}
//----------------------------------------------------------------------


















































Measured memory_bytes: 4756