#include <algorithm>
#include <fstream>
#include <bitset>
#define PII pair<int, int>
#define x first
#define y second
#define maxs(a, b) if(a<(b)) a=(b)

using namespace std;

const int N=100004;

ifstream fin("marbles.in");
ofstream fout("marbles.out");

PII a[N];
int b[65][N], c[65];
bitset <65> v;

int main()
{
    int n, m, i, j, x, y, sol;
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>a[i].x>>a[i].y;
        v[a[i].y]=1;
    }
    for(i=1;i<65;i++) if(v[i]) c[++c[0]]=i;
    sort(a+1, a+n+1);
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=c[0];j++) b[c[j]][i]=b[c[j]][i-1];
        b[a[i].y][i]++;
    }
    while(m--)
    {
        fin>>x;
        if(!x)
        {
            fin>>x>>y;
            i=lower_bound(a+1, a+n+1, make_pair(x, 0))-a;
            a[i].x+=y;
        }
        else
        {
            fin>>x>>y;
            i=lower_bound(a+1, a+n+1, make_pair(x, 0))-a;
            j=lower_bound(a+1, a+n+1, make_pair(y, 0))-a-1;
            sol=0;
            for(x=1;x<=c[0];x++)
            {
                maxs(sol, b[c[x]][j]-b[c[x]][i-1]);
            }
            fout<<sol<<"\n";
        }
    }
}