#include <cstdio>
#include <algorithm>

using namespace std;

#define max(a, b) ((a > b) ? a : b)
#define x first
#define c second
#define NMAX 100005

int N, M, S[64][100005], Res;
pair <int ,int> v[NMAX];

int bsearch(int X)
{
        int l, r, m, poz = N;

        for (l = 1, r = N; l <= r; )
        {
                 m = (l + r) / 2;
                 if (v[m].x < X)
                       l = m+1;
                 else
                       poz = m, r = m-1;
        }
        return poz;
}

int main()
{
        int tip, i, j, i1, i2;

        freopen("marbles.in", "r", stdin);
        freopen("marbles.out", "w", stdout);

        scanf("%d %d", &N, &M);
        for (i = 1; i <= N; ++i)
        {
                scanf("%d %d", &v[i].x, &v[i].c);
                --v[i].c;
        }
        sort(v+1, v+N+1);
        for (i = 1; i <= N; ++i)
        {
                for (j = 0; j < 64; ++j)
                        S[j][i] = S[j][i-1];
                S[v[i].c][i]++;
        }

        for (; M; --M)
        {
                scanf("%d %d %d", &tip, &i, &j);
                if (!tip)
                {
                        i1 = bsearch(i);
                        if (v[i1].x != i)
                                printf("GRESIT!\n");
                        v[i1].x += j;
                }
                else
                {
                        i1 = bsearch(i);
                        i2 = bsearch(j);
                        if (v[i2].x > j) --i2;
                        for (Res = 0, tip = 0; tip < 64; ++tip)
                                Res = max(Res, S[tip][i2] - S[tip][i1-1]);
                        printf("%d\n", Res);
                }
        }
        return 0;
}