#include<bits/stdc++.h>
using namespace std;
#define lowbit(x) x&(-x)
#define int long long

const int N = 1e7+10;
//int INF  = 1e9;
int mod = 998244353;

typedef struct{
	
    #define lowbit(x) x&(-x)
    #define int long long
    typedef long long ll;
    int sum1[N],sum2[N];

    void add(ll p, ll x){
        for(int i = p; i <= 1e7; i += i & -i)
            sum1[i] += x, sum2[i] += x * p;
    }

    void range_add(ll l, ll r, ll x){
        add(l, x), add(r + 1, -x);
    }

    ll ask(ll p){
        ll res = 0;
        for(int i = p; i; i -= i & -i)
            res += (p + 1) * sum1[i] - sum2[i];
        return res;
    }

    ll range_ask(ll l, ll r){
        return ask(r) - ask(l - 1);
    }

}TR;

TR tree;

int n,m;

int cnt;
int input[100005][3];
vector<int> st;

int getid(int x)
{
    return lower_bound(st.begin(),st.end(),x)-st.begin()+1;
}

void solve() {
    cin>>n>>m;

    int x,v,l,r,op;

    for(int i = 1;i<=m;i++)
	{
        cin>> input[i][0]>>input[i][1]>>input[i][2];
        st.push_back(input[i][1]);
        if(input[i][0] == 2)st.push_back(input[i][2]);

        if(input[i][0] == 1){
            x = input[i][1];
            while(x <= n){
                st.push_back(x);
                x += lowbit(x);
            }
        }
    }

    sort(st.begin(),st.end());
    st.erase(unique(st.begin(),st.end()) ,st.end());

    for(int i = 1;i<=m;i++)
	{
        if(input[i][0] == 2)
		{
            l = getid(input[i][1]);
            r = getid(input[i][2]);

            cout<<tree.range_ask(l,r)<<endl;
        }
        else{
            x = input[i][1];
            v = input[i][2];

            while(x <= n){
                int id = getid(x);
                tree.range_add(id,id,v);
                x += lowbit(x);
            }
        }
    }
}
signed main() 
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int caset = 1;


    for(int i = 1;i<=caset;i++){
        solve();
    }

    return 0;
}