#include <algorithm>
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("marbles.in");
ofstream out("marbles.out");
const int maxn = 100005;
const int maxcul = 64;
pair <int, int> v[maxn];
int sp[maxn][maxcul + 5];
int n;

int caut_bin1(int x)
{
    int st = 1;
    int 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;
    int 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()
{
    int m;
    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 <= maxcul; j++)
        {
            if(v[i].second == j)
                sp[i][j] = sp[i - 1][j] + 1;
            else
                sp[i][j] = sp[i - 1][j];
        }
    }
    for(int i = 1; i <= m; i++)
    {
        int op, x, y;
        in >> op >> x >> y;
        if(op == 0)
        {
            int p = caut_bin1(x);
            v[p].first += y;
        }
        else
        {
            int mx = -(1 << 30);
            int p = caut_bin1(x);
            int q = caut_bin2(y);
            for(int cul = 1; cul <= maxcul; cul++)
                mx = max(mx, sp[q][cul] - sp[p - 1][cul]);
            out << mx << "\n";
        }
    }
    return 0;
}