#include <bits/stdc++.h>
#define pb push_back
#define NMAX 100005
#define ll long long
#define x first
#define y second

using namespace std;

ifstream fin("marbles.in");
ofstream fout("marbles.out");

int sp[NMAX][65],n;
pair<int,int> v[NMAX];

int search_bound(int x, int type) {
	int st=1,dr=n,mid;

	while(st<=dr) {
		mid=(st+dr)/2;

		if(v[mid].x>x || (type==0 && v[mid].x==x))
			dr=mid-1;
		else st=mid+1;
	}

	if(type==0) return st;
	else return dr;
}

int main() {
	int m,i,x,y,j,t,st,dr,ans,pos;

	fin>>n>>m;

	for(i=1;i<=n;++i) fin>>v[i].x>>v[i].y;
	sort(v+1,v+n+1);

	for(i=1;i<=n;++i) {
		++sp[i][v[i].y];

		for(j=1;j<=64;++j) sp[i][j]+=sp[i-1][j];
	}

	while(m--) {
		fin>>t>>x>>y;

		if(t==0) {
			pos=search_bound(x,0);
			v[pos].x+=y;
		}
		else {
			st=search_bound(x,0);
			dr=search_bound(y,1);

			for(i=1,ans=0;i<=64;i++) ans=max(ans,sp[dr][i]-sp[st-1][i]);
			fout<<ans<<'\n';
		}
	}

	return 0;
}