#define DEBUG 1
#define MULTI_TEST 1
#include <cassert>
#include <array>
#include <cstdio>
#include <unordered_map>
#include <algorithm>
#include <vector>
#include <chrono>
#include <random>
typedef long long LL;
typedef long double LF;
template <class T> using Arr = std::vector<T>;
template <class T> using Ptn = std::pair<T, T>;
const int MOD = 998244353;
const int INF = 0x3F3F3F3F;
#define MUL(u, v) (int)((LL)(u) * (v) % MOD)
inline int Pow(int a, int b) { int r = 1; for (; b > 0; b >>= 1, a = MUL(a, a)) if (b & 1) r = MUL(r, a); return r; }
inline int &Norm(int &x) { return x %= MOD; }
#define RNG(v) (v).begin(), (v).end()
#define FOR(i, s, t) for (int i = (s), i##_end = (t); i < i##_end; ++i)
#define ROF(i, s, t) for (int i = (s) - 1, i##_end = (t); i >= i##_end; --i)

template <class T>
void read(T &n) {
	n = 0;
	char ch;
	bool flag = false;
	do if ((ch = getchar()) == '-') flag = true;
	while (ch < '0' || ch > '9');
	for (; '0' <= ch && ch <= '9'; ch = getchar())
		n = (n << 1) + (n << 3) + ch - '0';
	if (flag)
		n = -n;
}

int rand() {
	static std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
	int r = (int)rng();
	return r < 0 ? -r : r;
}
int rand(int l, int r) { return l + rand() % (r - l + 1); }

struct sum_seg_t {
	int n;
	Arr<LL> tr;
	sum_seg_t(Arr<int> a) : n(a.size()), tr(2 * n) {
		FOR(i, 0, n)
			tr[n + i] = a[i];
		for (int i = n - 1; i > 0; --i)
			tr[i] = tr[i << 1] + tr[i << 1 | 1];
	}
	void modify(int p, int v) {
		tr[p += n] = v;
		for (p >>= 1; p > 0; p >>= 1)
			tr[p] = tr[p << 1] + tr[p << 1 | 1];
	}
	LL sum(int l, int r) {
		LL ans = 0;
		for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
			if (l & 1) ans += tr[l++];
			if (r & 1) ans += tr[--r];
		}
		return ans;
	}
};

// 线段树上倍增这么难写 ()
struct map_seg_t {
	int n, sz;
	typedef std::unordered_map<int, int> htable;
	Arr<htable> tr;
	htable merge(const htable &u, const htable &v) {
		auto rt = u;
		for (auto [x, c] : v)
			rt[x] += c;
		return rt;
	}
	map_seg_t(Arr<int> c) : n(c.size()) {
		for (sz = 1; sz < n; sz <<= 1)
			;
		tr.resize(sz << 1);
		FOR(i, 0, n)
			tr[sz + i][c[i]] = 1;
		ROF(i, sz, 1)
			tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
	}
	void modify(int p, int c) {
		auto it = tr[p += sz].begin();
		int oldc = it->second;
		tr[p].erase(it);
		assert(tr[p].size() == 0);
		tr[p][c] = 1;
		for (p >>= 1; p > 0; p >>= 1) {
			--tr[p][oldc];
			++tr[p][c];
		}
	}
	static int count_cell(const htable &map, const Arr<int> &v) {
		int ans = 0;
		for (auto c : v)
			if (map.count(c))
				ans += map.at(c);
		return ans;
	}
	static inline int LB(int x) { return x & -x; }
	static inline bool leftmost(int x) { return x == LB(x); }
	static inline int prev_fa(int x) { return (x >> 1) - (~x & 1); }
	static inline int prev_son(int x) { return (x << 1) - 1; }
	static inline bool rightmost(int x) { return leftmost(x + 1); }
	static inline int next_fa(int x) { return (x >> 1) + (x & 1); }
	static inline int next_son(int x) { return (x << 1) + 2; }
	int findl(int p, const Arr<int> &v) {
		p += sz;
		int h = 1;
		do {
			for (; p % 2 == 1 && p > 1; p >>= 1)
				h <<= 1;
			if (count_cell(tr[p], v) != h) {
				while (p < sz) {
					p = p * 2 + 1;
					h >>= 1;
					if (count_cell(tr[p], v) == h)
						--p;
				}
				return p + 1 - sz;
			}
			--p;
		} while (!rightmost(p));
		return 0;
	}
	int findr(int p, const Arr<int> &v) {
		p += sz;
		int h = 1;
		do {
			for (; p % 2 == 0; p >>= 1)
				h <<= 1;
			if (count_cell(tr[p], v) != h) {
				while (p < sz) {
					p <<= 1;
					h >>= 1;
					if (count_cell(tr[p], v) == h)
						++p;
				}
				return p - 1 - sz;
			}
			++p;
		} while(p != (p & -p));
		return n - 1;
	}
};

void Solve() {
	int n, q;
	read(n); read(q);
	Arr<int> c(n), v(n);
	FOR(i, 0, n)
		read(c[i]);
	FOR(i, 0, n)
		read(v[i]);

	sum_seg_t sum_seg(v);
	map_seg_t map_seg(c);

	FOR(qq, 0, q) {
		int op;
		read(op);
		if (op == 1) {
			int p, x;
			read(p); read(x);
			map_seg.modify(p - 1, x);
		} else if (op == 2) {
			int p, x;
			read(p); read(x);
			sum_seg.modify(p - 1, x);
		} else {
			int x, k;
			read(x); read(k);
			--x;
			Arr<int> v(k);
			for (auto &x : v)
				read(x);
			int l = map_seg.findl(x, v);
			int r = map_seg.findr(x, v);
			// printf("[%d, %d] => %lld\n", l + 1, r + 1, sum_seg.sum(l, r + 1));
			printf("%lld\n", sum_seg.sum(l, r + 1));
		}
	}
}

int main() {
	int T;
#if MULTI_TEST
	scanf("%d", &T);
#else
	T = 1;
#endif
	while (T--)
		Solve();
	return 0;
}