#include<bits/stdc++.h>
#define lowbit(x) (x&(-x))
#define rep(x,a,b) for(int x=a;x<=b;x++)
// #define pre(x,a,b) for(int x=a;x>=b;x--)
#define endl "\n"
#define pb push_back
#define ll long long
#define int long long
#define pii pair<ll,ll>
#define psi pair<string, ll>
#define de cout<<1;
#define mem(a,x) memset(a,x,sizeof a)
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
const int mod1=998244353;
const int mod2=1e9+7;
const int N = 1e5 + 60;
int number;
int n, m;
ll parl[N];
ll parr[N];
void addl(ll x)
{
    for(ll i=x;i<=n;i+=lowbit(i))
    {
        parl[i]+=1;
    }
}
void addr(ll x)
{
    for(ll i=x;i<=n;i+=lowbit(i))
    {
        parr[i]+=1;
    }
}

ll askl(ll x)
{
    ll sum=0;
    for(ll i=x;i;i-=lowbit(i))sum+=parl[i];
    return sum;
}

ll askr(ll x)
{
    ll sum=0;
    for(ll i=x;i;i-=lowbit(i))
    {
        sum+=parr[i];
    }
    return sum;
}


void solve()
{
   while(cin >> n >> m )
   {
      while(m--)
      {
        
        int op ,a, b;
        cin >>op >> a >> b;
        if(op==1)
        {
            addl(a);
            addr(b+1);
        }
        else{
            cout << askl(a)-askr(b-1)<<endl;
        }
      }
      rep(i,0,n)parr[i]=0,parl[i]=0;
   }
}
signed main()
{
	IOS;
	int _;
	//cin >> _;
	_ = 1;
	while(_ -- )
	{
		number++;
		solve();
	}
	return 0;
}