#include <iostream>
#include <vector>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <queue>
#include <fstream>
#include <stdio.h>
#include <string.h>
#include <iomanip>
#include <stack>
#include <climits>
#include <unordered_map>
#include <map>
#include <set>
#include <cmath>
using namespace std;

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

/*
dp[i]=cate plicuri pot baga in plicul de dimensiuni L[i], W[i]
*/

int n, a[100002], m;
int fr[70];

int main()
{
	int i, j, x, ans;
	bool op;
	fin >> n >> m;
	for (i = 1; i <= n; i++)
	{
		fin >> j >> x;
		a[j] = x;
	}
	while (m--)
	{
		fin >> op >> i >> j;
		if (!op) a[i + j] = a[i];
		else
		{
			ans = -1;
			for (int t = i; t <= j; t++)
				fr[a[t]] = 0;
			for (int t = i; t <= j; t++)
			{
				fr[a[t]]++;
				ans = max(ans, fr[a[t]]);
			}
			fout << ans << "\n";
		}
	}
	return 0;
}