#include <algorithm>
#include <stdio.h>
#define DIM 100005
#define CUL 65
using namespace std;
struct bila {int x,in;} a[DIM];
int s[CUL][DIM];
int n,m;
void read ()
{
	int i;
	scanf ("%d%d",&n,&m);
	for (i=1; i<=n; ++i)
		scanf ("%d%d",&a[i].in,&a[i].x);
}
int cmp (bila a,bila b)
{
	return a.in<b.in;
}
void prec ()
{
	int i,j;
	for (i=1; i<CUL; ++i)
		for (j=1; j<=n; ++j)
			if (a[j].x==i)
				s[i][j]=s[i][j-1]+1;
			else
				s[i][j]=s[i][j-1];
}
void getmax (int x,int y)
{
	int i,maxim=0;
	for (i=1; i<CUL; ++i)
		if (s[i][y]-s[i][x-1]>maxim)
			maxim=s[i][y]-s[i][x-1];
	printf ("%d\n",maxim);
}
int cbin (int val)
{
    int st,dr,mij;
    for (st=1, dr=n; st<=dr; )
    {
        mij=(st+dr)/2;
        if (a[mij].in==val)
            return mij;
        if (a[mij].in<val)
            st=mij+1;
        else
            dr=mij-1;
    }
    return mij;
}
void query ()
{
	int i,tip,x,y,u,v;
	for (i=1; i<=m; ++i)
	{
		scanf ("%d%d%d",&tip,&x,&y);
		if (tip==1)
		{
			u=cbin (x);
			if (a[u].in<x)
				++u;
			v=cbin (y);
			if (a[v].in>y)
				--v;
			getmax (u,v);
		}
		else
		{
		    x=cbin (x);
            a[x].in+=y;
		}
	}
}
int main ()
{
	freopen ("marbles.in","r",stdin);
	freopen ("marbles.out","w",stdout);
	read ();
	sort (a+1,a+n+1,cmp);
	prec ();
	query ();
	return 0;
}