#include <fstream>
#include <vector>
#include <map>
#include <algorithm>

#define dbg(x) cerr << #x << ": " << endl;
using namespace std;

ifstream cin("marbles.in");
ofstream cout("marbles.out");

vector<int> s[70];
map<int, int> mp;

void swap(int &a, int &b){
	a ^= b;
	b ^= a;
	a ^= b;
}

void xSort(int cul, int pz){
	while(pz < s[cul].size() && s[cul][pz] > s[cul][pz + 1])
		swap(s[cul][pz], s[cul][pz + 1]), ++pz;
	while(pz >= 0 && s[cul][pz] < s[cul][pz - 1])
		swap(s[cul][pz], s[cul][pz - 1]), --pz;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int n, m;
	cin >> n >> m;

	for(int i = 1; i <= n; ++i){
		int x, cul;
		cin >> x >> cul;

		mp[x] = cul;
		s[cul].push_back(x);
	}

	for(int i = 1; i <= 64; ++i)
		sort(s[i].begin(), s[i].end());

	for(int i = 1; i <= m; ++i){
		int t, xi, xj;
		cin >> t >> xi >> xj;

		if(t == 0){
			int cul = mp[xi];
			mp[xi + xj] = cul;
			int pz = lower_bound(s[cul].begin(), s[cul].end(), xi) - s[cul].begin();
			s[cul][pz] += xj;
			xSort(cul, pz);
		}
		else {
			int lgMax = 0;
			for(int cul = 1; cul <= 64; ++cul){
				int st = lower_bound(s[cul].begin(), s[cul].end(), xi) - s[cul].begin();
				auto ax = upper_bound(s[cul].begin(), s[cul].end(), xj);
				--ax;
				int fs = ax - s[cul].begin();
				lgMax = max(lgMax, fs - st + 1);
			}
			cout << lgMax << '\n';
		}
	}
	return 0;
}