#include <bits/stdc++.h>

using namespace std;

int read()
{
    char c;
    while (!isdigit(c = getchar()));
    int x = c ^ '0';
    while (isdigit(c = getchar())) {
        x = (x << 3) + (x << 1) + (c ^ '0');
    }
    return x;
}

const int N = 5e5 + 5;

int n, a[N], b[N];
long long s[N];

void modify(int x, int y)
{
    for (int i = x; i <= n; i += i & -i) {
        s[i] += y;
    }
    return;
}

long long query(int x)
{
    long long s = 0;
    for (; x; x -= x & -x) {
        s += ::s[x];
    }
    return s;
}

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

unordered_map<int, int> S[1 << 20];

void build(int k, int l, int r)
{
    S[k].clear();
    for (int i = l; i <= r; ++i) {
        ++S[k][a[i]];
    }
    if (l == r) {
        return;
    }
    int mid = (l + r) >> 1;
    build(k << 1, l, mid);
    build(k << 1 | 1, mid + 1, r);
    return;
}

void modify(int k, int l, int r, int x, int y)
{
    --S[k][a[x]];
    ++S[k][y];
    if (l == r) {
        return;
    }
    int mid = (l + r) >> 1;
    if (x <= mid) {
        modify(k << 1, l, mid, x, y);
    } else {
        modify(k << 1 | 1, mid + 1, r, x, y);
    }
    return;
}

vector<int> ck;

int queryPre(int k, int l, int r, int x)
{
    int s = 0;
    for (int i = 0; i < (int)ck.size() && s != r - l + 1; ++i) {
        s += S[k][ck[i]];
    }
    if (s == r - l + 1) {
        return l;
    }
    if (!s) {
        return r + 1;
    }
    if (l == r) {
        return l;
    }
    int mid = (l + r) >> 1;
    if (mid >= x) {
        return queryPre(k << 1, l, mid, x);
    }
    int z = 0;
    if ((z = queryPre(k << 1 | 1, mid + 1, r, x)) == mid + 1) {
        return queryPre(k << 1, l, mid, x);
    }
    return z;
}

int queryNxt(int k, int l, int r, int x)
{
    int s = 0;
    for (int i = 0; i < (int)ck.size() && s != r - l + 1; ++i) {
        s += S[k][ck[i]];
    }
    if (s == r - l + 1) {
        return r;
    }
    if (!s) {
        return l - 1;
    }
    if (l == r) {
        return l;
    }
    int mid = (l + r) >> 1;
    if (mid < x) {
        return queryNxt(k << 1 | 1, mid + 1, r, x);
    }
    int z = 0;
    if ((z = queryNxt(k << 1, l, mid, x)) == mid) {
        return queryNxt(k << 1 | 1, mid + 1, r, x);
    }
    return z;
}

signed main()
{
    int T = read();
    while (T--) {
        int q;
        n = read(), q = read();
        for (int i = 1; i <= n; ++i) {
            a[i] = read();
            s[i] = 0;
        }
        for (int i = 1; i <= n; ++i) {
            b[i] = read();
            modify(i, b[i]);
        }
        build(1, 1, n);
        while (q--) {
            int opt = read(), x = read(), y = read();
            if (opt == 1) {
                modify(1, 1, n, x, y);
                a[x] = y;
            } else if (opt == 2) {
                modify(x, y - b[x]);
                b[x] = y;
            } else if (opt == 3) {
                ck.resize(y);
                for (int i = 0; i < y; ++i) {
                    scanf("%d", &ck[i]);
                }
                int t1 = queryPre(1, 1, n, x), t2 = queryNxt(1, 1, n, x);
                printf("%lld\n", query(t1, t2));
            }
        }
    }
    return 0;
}