#include <fstream>
#include <algorithm>
#define X first
#define Y second
using namespace std;
ifstream fin("marbles.in");
ofstream fout("marbles.out");
int n,m,i,maxim,sol,st,j,mid,dr,st1,x,y,t,s[65][100010];
pair<int,int> v[100010];
int main(){
    fin>>n>>m;
    for(i=1;i<=n;i++){
        fin>>v[i].X>>v[i].Y;
        if(v[i].Y>maxim)
            maxim=v[i].Y;
    }
    sort(v+1,v+n+1);
    for(i=1;i<=n;i++)
        for(j=1;j<=maxim;j++)
            if(j==v[i].Y)
                s[j][i]=1+s[j][i-1];
            else
                s[j][i]=s[j][i-1];
    for(;m--;){
        fin>>t>>x>>y;
        if(t==0){
            st=1;
            dr=n;
            while(st<=dr){
                mid=(st+dr)/2;
                if(v[mid].X==x)
                    break;
                if(v[mid].X<x)
                    st=mid+1;
                else
                    dr=mid-1;
            }
            if(st<=dr)
                v[mid].X+=y;
        }else{
            st=1;
            dr=n;
            while(st<=dr){
                mid=(st+dr)/2;
                if(v[mid].X<x)
                    st=mid+1;
                else
                    dr=mid-1;
            }
            st1=st;
            st=1;
            dr=n;
            while(st<=dr){
                mid=(st+dr)/2;
                if(v[mid].X>y)
                    dr=mid-1;
                else
                    st=mid+1;
            }
            sol=0;
            for(i=1;i<=maxim;i++)
                sol=max(sol,s[i][dr]-s[i][st1-1]);
            fout<<sol<<"\n";
        }
    }
    return 0;
}