#include <vector>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

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;
	}
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;
 
    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }
 
 
public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }
 
    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }
 
    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }
 
    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};



const int CULORI = 64;
vector <int> marbles[CULORI + 1];
unordered_map <int, int> umap;

int main(){
    ios::sync_with_stdio(false);
    InParser fin("marbles.in");
    OutParser fout("marbles.out");
    int n, q;
    fin >> n >> q;
    for(int i = 0; i < n; i++){
        int x, culoare;
        fin >> x >> culoare;
        marbles[culoare].push_back(x);
        umap.insert({x, culoare});
    }
    for(int i = 1; i <= CULORI; i++) sort(marbles[i].begin(), marbles[i].end());
    while(q--){
        int cerr, x, y;
        fin >> cerr >> x >> y;
        if(cerr == 0){
            int c = umap[x];
            umap.erase(x);
            umap.insert({x + y, c});
            int st = 0, dr = marbles[c].size();
            while(dr - st > 1){
                int mij = (st + dr) / 2;
                if(marbles[c][mij] > x) dr = mij;
                else st = mij;
            }
            marbles[c][st] += y;
        }else{
            int ans = 0;
            for(int c = 1; c <= CULORI; c++){
                if(marbles[c].size() > 0){
                    int st = 0, dr = (int)marbles[c].size();
                    while(dr - st > 1){
                        int mij = (st + dr) / 2;
                        if(marbles[c][mij] > x) dr = mij;
                        else st = mij;
                    }
                    int poz1 = st;
                    st = 0, dr = (int)marbles[c].size();
                    while(dr - st > 1){
                        int mij = (st + dr) / 2;
                        if(marbles[c][mij] > y) dr = mij;
                        else st = mij; 
                    }
                    int poz2 = st;
                    while(marbles[c][poz1] < x && poz1 + 1 < (int)marbles[c].size()) poz1++;
                    //while(marbles[c][poz2] < y && poz2 + 1 < (int)marbles[c].size()) poz2++;
                    if(poz1 < (int)marbles[c].size() && poz2 < (int)marbles[c].size() && marbles[c][poz1] >= x && marbles[c][poz2] <= y) ans = max(ans, poz2 - poz1 + 1);
                }
            }
            fout << ans << '\n';
        }
    }
    return 0;
}