#include <bits/stdc++.h>
using namespace std;
using LL = long long;

template<typename T>
struct Fenwick{
    int n;
    std::vector<T> tr;

    Fenwick(int n) : n(n), tr(n + 1, 0){}

    int lowbit(int x){
        return x & -x;
    }

    void modify(int x, T c){
        for(int i = x; i <= n; i += lowbit(i)) tr[i] += c;
    }

    void modify(int l, int r, T c){
        modify(l, c);
        if (r + 1 <= n) modify(r + 1, -c);
    }

    T query(int x){
        T res = T();
        for(int i = x; i; i -= lowbit(i)) res += tr[i];
        return res;
    }

    T query(int l, int r){
        return query(r) - query(l - 1);
    }

    int find_first(T sum){
        int ans = 0; T val = 0;
        for(int i = std::__lg(n); i >= 0; i--){
            if ((ans | (1 << i)) <= n && val + tr[ans | (1 << i)] < sum){
                ans |= 1 << i;
                val += tr[ans];
            }
        }
        return ans + 1;
    }

    int find_last(T sum){
        int ans = 0; T val = 0;
        for(int i = std::__lg(n); i >= 0; i--){
            if ((ans | (1 << i)) <= n && val + tr[ans | (1 << i)] <= sum){
                ans |= 1 << i;
                val += tr[ans];
            }
        }
        return ans;
    }

};
using BIT = Fenwick<LL>;

// 比 unordered_map 更快的哈希表
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash {
    int operator()(int x) const { return x ^ RANDOM; }
};
typedef gp_hash_table<int, int, chash> hash_t;

constexpr int N = 1E5 + 5;
hash_t T[N];

int n,q;

int lowbit(int x) {
	return x & (-x);
}
void modify(int x , int c , int val) {
	for ( ; x <= n ; x += lowbit(x)) {
		T[x][c] += val;
	}
}
int query(int x,vector<int>& s) {
	int cnt = 0;
	for (; x ; x -= lowbit(x)) {
		for (auto c : s) {
			auto it = T[x].find(c);
			if (it != T[x].end()) {
				cnt += it->second;
			}
		}
	}
	return cnt;
}
int queryl(int lim,vector<int>& s) {
	
	int base = query(lim , s);
	if (base == lim) return 1;

	int b = 1;
	while (b <= n) b <<= 1;
		
	int now = 0 , cnt = 0;
	for (b >>= 1 ; b ; b >>= 1) {
		int nxt = now | b , tmp = 0;
		for (auto c : s) {
			auto it = T[nxt].find(c);
			if (it != T[nxt].end()) {
				tmp += it->second;
			}
		}
		if (!(nxt > lim || base - (cnt + tmp) == lim - nxt)) {
			now = nxt , cnt += tmp;
		}
	}

	//所以 "1" 位置进行了特判
	return now + 2;
}
int queryr(int lim , vector<int>& s) {
	int base = query(lim , s);
	
	int b = 1;
	while (b <= n) b <<= 1;

	int now = 0 , cnt = 0;
	for (b >>= 1 ; b ; b >>= 1) {
		int nxt = now | b , tmp = 0;
		for (auto c : s) {
			auto it = T[nxt].find(c);
			if (it != T[nxt].end()) {
				tmp += it->second;
			}
		}
		if (nxt < lim || (cnt + tmp) - base == nxt - lim) {
			now = nxt , cnt += tmp;
		}
	}
	return now;
}

void solve() {

	cin >> n >> q;

	vector<int> c(n + 1) , v(n + 1);
	for (int i = 1 ; i <= n ; ++i) {
		cin >> c[i];
	}
	for (int i = 1 ; i <= n ; ++i) {
		cin >> v[i];
	}

	BIT tr(n);
	for (int i = 1 ; i <= n ; ++i) {
		tr.modify(i , v[i]);
	}
	for (int i = 1 ; i <= n ; ++i) {
		modify(i , c[i] , 1);
	}

	for (int i = 1 ; i <= q ; ++i) {
		int opt;
		cin >> opt;
		if (opt == 1) {
			int p,x;
			cin >> p >> x;
			if (c[p] == x) continue;
			modify(p , c[p] , -1);
			c[p] = x;
			modify(p , c[p] , 1);
		} else if (opt == 2) {
			int p,x;
			cin >> p >> x;
			if (v[p] == x) continue;
			tr.modify(p , x - v[p]);
			v[p] = x;
		} else {
			int x,k;
			cin >> x >> k;
			vector<int> s(k);
			for (int j = 0 ; j < k ; ++j) {
				cin >> s[j];
			}
			int l = queryl(x , s);
			int r = queryr(x , s);
			cout << tr.query(r) - tr.query(l - 1) << "\n";
		}
	}

	for (int i = 1 ; i <= n ; ++i) {
		T[i].clear();
	}
}

int main() {

	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}

	return 0;
}