// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <stack>
#include <random>
#include <fstream>
#include <sstream>
#include <chrono>

#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) for (auto& x: v) cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)

#define int ll

template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}

using namespace std;

#ifdef __LOCAL
	#define dbg(x) cerr << #x << " : " << x << '\n'
	const int maxn = 20;
#else
	#define dbg(x)
	const int maxn = 1e5 + 5;
#endif

//tg: @galebickosikasa

ostream& operator << (ostream& out, vector<int>& v) {
	for (auto& x: v) out << x << ' ';
	return out;
}

ostream& operator << (ostream& out, pii& v) {
	out << v.fi << ", " << v.se;
	return out;
}

istream& operator >> (istream& in, pii& a) {
	in >> a.fi >> a.se;
	return in;
}

const ll inf = (ll) 2e9;
const ld pi = asin (1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;
const int maxm = 50 + 5;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

set <int> kek[maxm];
int l[maxn], r[maxn], k;

struct tree {
	vector<int> t, assign;
	int size = 0, capacity;

	tree (int n) {
		while ((1<<size) < n) ++size;
		++size;
		size = (1<<size);
		capacity = (size>>1);
		t = vector<int> (size);
		assign = vector<int> (size);
		fl (i, n, capacity) t[i + capacity] = inf;
		for (int i = capacity - 1; i > 0; --i) t[i] = min (t[i * 2], t[i * 2 + 1]);
	}

	void push (int cur) {
		assign[cur * 2] += assign[cur];
		assign[cur * 2 + 1] += assign[cur];
		assign[cur] = 0;
	}

	void render (int cur) {
		t[cur] = min (t[cur * 2] + assign[cur * 2], t[cur * 2 + 1] + assign[cur * 2 + 1]);
	}

	void add (int cur, int left, int right, int l, int r, int x) {
		if (cur >= size) return;
		if (left > r || right < l) return;
		if (l <= left && r >= right) {
			assign[cur] += x;
		} else {
			push (cur);
			add (cur * 2, left, (left + right) / 2, l, r, x), add (cur * 2 + 1, (left + right) / 2 + 1, right, l, r, x);
			render (cur);
		}
	}

	void add (int l, int r, int x) {
		add (1, 0, capacity - 1, l, r, x);
	}

	int get (int i) {
		int j = i;
		i += capacity;
		i >>= 1;
		vector<int> tmp;
		while (i) {
			tmp.pb (i);
			i >>= 1;
		}
		reverse (all (tmp));
		for (auto& x: tmp) push (x);
		return t[j] + assign[j];
	}

	int get () {
		return t[1] + assign[1];
	}
};

signed main () {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	for (auto& x: l) x = inf;
	int n, q;
	cin >> n >> k >> q;
	vector<int> goo (n);
	cinv (goo);
	tree moo (n);
	for (int i = n - 1; i >= 0; --i) {
		int x = goo[i];
		kek[x].insert (i);
		int mx = i;
		fl (j, 1, k + 1) {
			auto it = kek[j].begin ();
			if (it == kek[j].end ()) mx = inf;
			else chkmax (mx, *it);
		}
		if (mx != inf) {
			moo.add (i, i, mx);
			chkmax (r[mx], i);
			chkmin (l[mx], i);
		} else {
			moo.add (i, i, inf);
		}
		dbg (mx);
	}
	dbg (moo.t);
	dbg (moo.assign);
	while (q--) {
		int t;
		cin >> t;
		if (t == 1) {
			int a, i;
			cin >> a >> i;
			--i;
			int prev = goo[i];
			int L = l[i], R = r[i];
			if (L <= R) {
				auto it = kek[prev].upper_bound (i);
				if (it == kek[prev].end ()) {
					int tmp = moo.get (R);
					moo.add (L, R, inf - tmp);
				} else {
					int j = *it;
					moo.add (L, R, j - i);
					chkmin (l[j], l[i]);
					chkmax (r[j], r[i]);
				}
			}
			dbg (moo.t);
			dbg (moo.assign);
			kek[prev].erase (i);
			kek[a].insert (i);
			l[i] = inf;
			r[i] = 0;
			if (L <= R) {
				int mx = i;
				fl (j, 1, k + 1) {
					auto it = kek[j].lower_bound (i);
					if (it != kek[j].end ()) chkmax (mx, *it);
					else mx = inf;
				}
				if (mx == inf) {
					int tmp = moo.get (R);
					moo.add (L, R, inf - tmp);
				} else {
					moo.add (L, R, mx - i);
					chkmin (l[mx], l[i]);
					chkmax (r[mx], r[i]);
				}
			}
			{
				auto it = kek[a].upper_bound (i);
				if (it != kek[a].end ()) {
					L = l[*it], R = r[*it];
					if (L <= R) {
						l[*it] = i + 1;
						moo.add (L, R, -(*it - R));
						int mx = R;
						fl (j, 1, k + 1) {
							auto it = kek[j].lower_bound (R);
							if (it != kek[j].end ()) chkmax (mx, *it);
							else mx = inf;
						}
						if (mx == inf) {
							int tmp = moo.get (R);
							moo.add (L, R, inf - tmp);
						} else {
							moo.add (L, R, mx - R);
							chkmin (l[mx], l[i]);
							chkmax (r[mx], r[i]);
						}
					}
				}
			}
			{
				int mx = i;
				fl (j, 1, k + 1) {
					auto it = kek[j].lower_bound (i);
					if (it != kek[j].end ()) chkmax (mx, *it);
					else mx = inf;
				}
				if (mx == inf) {
					int tmp = moo.get (i);
					moo.add (i, i, inf - tmp);
				} else {
					moo.add (i, i, mx - i);
					chkmin (l[mx], l[i]);
					chkmax (r[mx], r[i]);
				}
			}
			goo[i] = a;
		} else {
			cout << moo.get () + 1 << '\n';
		}
	}









}