#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define int long long
#define pii pair<int, int>
const int N = 1e5 + 10;
const int M = 2e3;
const int MAXA = 1e5 + 5;
#define endl '\n'

// 快读部分
inline int read() {
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = (x << 1) + (x << 3) + ch - '0';
        ch = getchar();
    }
    return f * x;
}

struct DynamicSegtree {
    struct node {
        int data, tag;
        node *lc, *rc;
        node(int data_ = 0) : data(data_), tag(0), lc(nullptr), rc(nullptr) {}
        void up() {
            data = 0;
            if (lc != nullptr)
                data += lc->data;
            if (rc != nullptr)
                data += rc->data;
            return;
        }
        void down(int l, int r) {
            if (lc == nullptr)
                lc = new node;
            if (rc == nullptr)
                rc = new node;
            int mid = (l + r) >> 1;
            lc->data += (mid - l + 1) * tag;
            lc->tag += tag;
            rc->data += (r - mid) * tag;
            rc->tag += tag;
            tag = 0;
        }
    } *rt = new node(0);

    void modify(node *rt, int L, int R, int l, int r, int val) {
        if (l <= L && R <= r) {
            rt->data += (R - L + 1) * val;
            rt->tag += val;
            return;
        }
        rt->down(L, R);
        int mid = (L + R) >> 1;
        if (l <= mid)
            modify(rt->lc, L, mid, l, r, val);
        if (r > mid)
            modify(rt->rc, mid + 1, R, l, r, val);
        rt->up();
        return;
    }

    int query(node *rt, int L, int R, int l, int r) {
        if (l <= L && R <= r) {
            return rt->data;
        }
        rt->down(L, R);
        int mid = (L + R) >> 1;
        int ret = 0;
        if (l <= mid)
            ret += query(rt->lc, L, mid, l, r);
        if (r > mid)
            ret += query(rt->rc, mid + 1, R, l, r);
        return ret;
    }
};

int n, q;
int val[N];

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

void update1(int r, int k) {
    for (int i = r; i <= n; i += lowbit(i))
        val[i] += k;
}

int get_sum(int l, int r) {
    int ans = 0;
    for (int i = r; i; i -= lowbit(i))
        ans += val[i];
    for (int i = l - 1; i; i -= lowbit(i))
        ans -= val[i];
    return ans;
}

void solve() {
    n = read();
    q = read();
    vector<DynamicSegtree> tree(n + 1);
    vector<int> c(n + 1);
    vector<int> v(n + 1);

    for (int i = 1; i <= n; i++) {
        c[i] = read();
        tree[c[i]].modify(tree[c[i]].rt, 1, MAXA, i, i, 1);
        val[i] = 0;
    }
    
    for (int i = 1; i <= n; i++) {
        v[i] = read();
        update1(i, v[i]);
    }
    
    while (q--) {
        int x = read();
        if (x == 1) {
            int p = read(), y = read();
            tree[c[p]].modify(tree[c[p]].rt, 1, MAXA, p, p, -1);
            tree[y].modify(tree[y].rt, 1, MAXA, p, p, 1);
            c[p] = y;
        } else if (x == 2) {
            int p = read(), y = read();
            update1(p, y - v[p]);
            v[p] = y;
        } else if (x == 3) {
            int st = read(), k = read();
            vector<int> a(k + 1);
            for (int i = 1; i <= k; i++) {
                a[i] = read();
            }
            sort(a.begin(), a.end());
            a.erase(unique(a.begin() + 1, a.end()), a.end());
            k = a.size() - 1;

            int l = 1, r = st;
            auto check1 = [&](int mid, const vector<int>& a, int st) -> bool {
                int sum = 0;
                for (int i = 1; i <= k; i++) {
                    int cnt = tree[a[i]].query(tree[a[i]].rt, 1, MAXA, mid, st);
                    sum += cnt;
                }
                return sum == st - mid + 1;
            };
            auto check2 = [&](int mid, const vector<int>& a, int st) -> bool {
                int sum = 0;
                for (int i = 1; i <= k; i++) {
                    int cnt = tree[a[i]].query(tree[a[i]].rt, 1, MAXA, st, mid);
                    sum += cnt;
                }
                return sum == mid - st + 1;
            };
            
            while (l <= r) {
                int mid = (l + r) >> 1;
                if (check1(mid, a, st))
                    r = mid - 1;
                else
                    l = mid + 1;
            }
            int ansl = l;
            l = st;
            r = n;
            while (l <= r) {
                int mid = (l + r + 1) >> 1;
                if (check2(mid, a, st))
                    l = mid + 1;
                else
                    r = mid - 1;
            }
            int ansr = r;
            printf("%lld\n", get_sum(ansl, ansr));
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = read();
    while (t--) {
        solve();
    }
    return 0;
}