#include <bits/stdc++.h>
#define maxN 100005
#define maxC 65
using namespace std;
int fq[maxN][maxC];
pair<int,int> v[maxN];
int n,m,i,j,st,dr,mij,sol,op,x,y;
int low_bound(int x)
{
    int st=1,dr=n;
    while(st<=dr)
    {
        int mij=st+(dr-st)/2;
        if(v[mij].first>=x)
            dr=mij-1;
        else st=mij+1;
    }
    return st;
}
int up_bound(int x)
{
    int st=1,dr=n;
    while(st<=dr)
    {
        int mij=st+(dr-st)/2;
        if(v[mij].first>x)
            dr=mij-1;
        else st=mij+1;
    }
    return dr;
}
int main()
{
    freopen("marbles.in","r",stdin);
    freopen("marbles.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(i=1;i<=n;i++)
        scanf("%d %d",&v[i].first,&v[i].second);
    sort(v+1,v+n+1);
    for(i=1;i<=n;i++)
        for(j=1;j<maxC;j++)
        {
            fq[i][j]=fq[i-1][j];
            if(v[i].second==j)
                fq[i][j]++;
        }
    while(m--)
    {
        scanf("%d %d %d",&op,&x,&y);
        if(!op)
            v[low_bound(x)].first+=y;
        else
        {
            sol=0;
            st=low_bound(x);
            dr=up_bound(y);
            for(i=1;i<maxC;i++)
                sol=max(sol,fq[dr][i]-fq[st-1][i]);
            printf("%d\n",sol);
        }
    }
    return 0;
}