#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,qc[200100],cn,tr[201000];
int op[101000],q;ll L[101000],R[100100];
void ad(ll x,ll z){
    x=lower_bound(qc+1,qc+cn+1,x)-qc;
    for(;x<=cn;x+=(x&-x))tr[x]+=z;
}
ll ask(ll x){
    x=lower_bound(qc+1,qc+cn+1,x)-qc;
    ll s=0;
    for(;x;x-=(x&-x))s+=tr[x];
    return s;
}
int main(){
    scanf("%lld%d",&n,&q);
    for(int i=1;i<=q;i++){
        scanf("%d%lld%lld",&op[i],&L[i],&R[i]);
        if(op[i]==2)
        qc[++cn]=L[i]-1,qc[++cn]=R[i];
    }
    if(cn==0)return 0;
    sort(qc+1,qc+cn+1);cn=unique(qc+1,qc+cn+1)-qc-1;
    for(int i=1;i<=q;i++){
        if(op[i]==1){
            ll x=L[i];
            for(;x<=n;x+=(x&-x))ad(x,R[i]);
        }
        else{
            printf("%lld\n",ask(R[i])-ask(L[i]-1));
        }
    }
    return 0;
}