#include <algorithm>
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("marbles.in");
ofstream out("marbles.out");
pair <int, int> v[100005];
int dp[100005][70];
int n, m;
int caut_bin(int x)
{
    int st = 1, dr = n;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        if(v[mij].first >= x)
            dr = mij - 1;
        else
            st = mij + 1;
    }
    return st;
}
int caut_bin2(int x)
{
    int st = 1, dr = n;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        if(v[mij].first <= x)
            st = mij + 1;
        else
            dr = mij - 1;
    }
    return dr;
}
int main()
{
    in >> n >> m;
    for(int i = 1; i <= n; i++)
        in >> v[i].first >> v[i].second;
    sort(v + 1, v + n + 1);
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= 64; j++)
        {
            dp[i][j] = dp[i - 1][j];
            if(v[i].second == j)
                dp[i][j]++;
        }
    }
    for(int i = 1; i <= m; i++)
    {
        int op, x, y;
        in >> op >> x >> y;
        if(op == 0)
        {
            int p = caut_bin(x);
            v[p].first += y;
        }
        else
        {
            int mx = 0;
            int X = caut_bin(x);
            int Y = caut_bin2(y);
            for(int cul = 1; cul <= 64; cul++)
                mx = max(mx, dp[Y][cul] - dp[X - 1][cul]);
            out << mx << "\n";
        }
    }
    return 0;
}