/*
                `-/oo+/-   ``
              .oyhhhhhhyo.`od
             +hhhhyyoooos. h/
            +hhyso++oosy- /s
           .yoooossyyo:``-y`
            ..----.` ``.-/+:.`
                   `````..-::/.
                  `..```.-::///`
                 `-.....--::::/:
                `.......--::////:
               `...`....---:::://:
             `......``..--:::::///:`
            `---.......--:::::////+/`
            ----------::::::/::///++:
            ----:---:::::///////////:`
            .----::::::////////////:-`
            `----::::::::::/::::::::-
             `.-----:::::::::::::::-
               ...----:::::::::/:-`
                 `.---::/+osss+:`
                   ``.:://///-.
*/
#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};

InParser in ("marbles.in");
ofstream out ("marbles.out");

const int N = 1e5;
const char CUL = 64;

int a[5 + CUL][5 + N];
int v[5 + CUL];

int cautst(int color, int elem) {
    int st, dr, mid, ans;
    st = 1;
    dr = v[color];
    ans = dr + 1;

    while(st <= dr) {
        mid = (st + dr) >> 1;
        if(a[color][mid] >= elem) {
            ans = mid;
            dr = mid - 1;
        } else st = mid + 1;
    }

    return ans;
}

int cautdr(int color, int elem) {
    int st, dr, mid, ans(0);
    st = 1;
    dr = v[color];

    while(st <= dr) {
        mid = (st + dr) >> 1;
        if(a[color][mid] <= elem) {
            ans = mid;
            st = mid + 1;
        } else dr = mid - 1;
    }

    return ans;
}

int main() {
    int n, m, culmax(0), i, j, x, c, y, tip, Max;

    in >> n >> m;

    for(i = 1; i <= n; i++) {
        int x, c;
        in >> x >> c;
        a[c][++v[c]] = x;
        culmax = max(culmax, c);
    }
    for(i = 1; i <= culmax; i++) sort(a[i] + 1, a[i] + v[i] + 1);

    for(i = 1; i <= m; i++) {
        Max = 0;
        in >> tip >> x >> y;

        for(j = 1; j <= culmax; j++) {
            if(tip == 0) {
                int pos = cautst(j, x);
                if(a[j][pos] == x)
                    a[j][pos] += y;
            } else {
                int posst = cautst(j, x);
                int posdr = cautdr(j, y);
                Max = max(Max, posdr - posst + 1);
            }
        }

        if(tip == 1)
            out << Max << '\n';
    }
    return 0;
}