#include<stdio.h>
using namespace std;
#define dim 100001
//unsigned long v[dim],w[dim],a[dim],b[dim]
int q[65],a[dim],v[dim],x,y,mij;
int caut_bin(int in, int sf)
{
mij=(in+sf)/2;
if(v[mij]==x) return mij;
else if(v[mij]>x) caut_bin(in,mij);
else caut_bin(v[mij],sf);
}
/*void merge_sort(int li, int ls)
{
int j,i,k,jum,m=0;
if(li==ls) return;
jum=(li+ls)/2;
merge_sort(li,jum);
merge_sort(jum+1,ls);
i=li;j=jum+1;k=li;
while((i<=jum)||(j<=ls))
{
if(j>ls || ( (i<=jum) && (v[i] < v[j])) )
{
w[k] = v[i]; m++; b[k]=a[i];
k++;
i++;
}
else
{
w[k] = v[j]; m++; b[k]=a[j];
k++;
j++;
}
}
for(i = ls; i >= li; i--)
{
v[i] = w[i]; a[i]=b[i];
}
} */
int main()
{int i,n,m,ok,max,j;
FILE *f=fopen("marbles.in","r"), *g=fopen("marbles.out","w");
fscanf(f,"%d%d",&n,&m);
for(i=1;i<=n;i++)
{
fscanf(f,"%d%d",&x,&y);
v[i]=x;
a[i]=y;
}
//merge_sort(1,n);
for(i=1;i<=m;i++)
{
fscanf(f,"%d%d%d",&ok,&x,&y);
if(ok==0)
{
caut_bin(1,n);
v[mij]=mij+y;
//merge_sort(1,n);
}
else
{
max=0;
for(j=1;j<=n;j++)
if((v[j]>=x)&&(v[j]<=y))
{
q[ a[j] ]++;
if(q[ a[j] ]>max)
max=q[ a[j] ];
if(v[j]>y) break;
}
fprintf(g,"%d\n",max);
for(j=1;j<=y;j++)
q[ a[j] ]=0;
}
}
fclose(f);
fclose(g);
return 0;}