#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5+10;

int C[maxn],V[maxn];
int a[maxn];

#define int long long

#define lc 2*rt
#define rc 2*rt+1

struct node {
    int l,r;
    int vsum,c;
    unordered_map<int,int> mp;
}seg[4*maxn];

void pushup(int rt) {
    seg[rt].vsum = seg[lc].vsum + seg[rc].vsum;
}

void build(int rt,int l,int r) {
    seg[rt].l = l;
    seg[rt].r = r;
    seg[rt].mp.clear();
    if(l==r) {
        seg[rt].vsum = V[l];
        seg[rt].mp[C[l]] = 1;
        seg[rt].c = C[l];
        return;
    }
    int mid = (l+r)>>1;
    build(lc,l,mid);
    build(rc,mid+1,r);
    pushup(rt);
    for(auto pr:seg[lc].mp) {
        seg[rt].mp[pr.first] += pr.second;
    }
    for(auto pr:seg[rc].mp) {
        seg[rt].mp[pr.first] += pr.second;
    }
}

void vchange(int tar,int rt,int l,int r,int v) {
    if(tar == l && l == r) {
        seg[rt].vsum = v;
        return;
    }
    int mid = (l+r)>>1;
    if(tar<=mid) vchange(tar,lc,l,mid,v);
    else vchange(tar,rc,mid+1,r,v);
    pushup(rt);
}
void cchange(int tar,int rt,int l,int r,int c,int prec) {
    seg[rt].mp[prec]--;
    seg[rt].mp[c]++;
    if(tar == l && l == r) {
        seg[rt].c = c;
        C[l] = c;
        return;
    }
    int mid = (l+r)>>1;
    if(tar<=mid) cchange(tar,lc,l,mid,c,prec);
    else cchange(tar,rc,mid+1,r,c,prec);
}


bool getcsum(int rt,int tarl,int tarr,int l,int r,int k) {
    if(tarl<=l&&r<=tarr) {
        int sum=0;
        for(int i=1;i<=k;i++) {
            sum += seg[rt].mp[a[i]];
        }
        return sum==(seg[rt].r-seg[rt].l+1);
    }
    int mid = (l+r)>>1;
    bool sum = true;
    if(tarl<=mid) sum &= getcsum(lc,tarl,tarr,l,mid,k);
    if(tarr>mid) sum &= getcsum(rc,tarl,tarr,mid+1,r,k);
    pushup(rt);
    return sum;
}

int getvsum(int rt,int tarl,int tarr,int l,int r,int k) {
    if(tarl<=l&&r<=tarr) {
        return seg[rt].vsum;
    }
    int mid = (l+r)>>1;
    int sum = 0;
    if(tarl<=mid) sum += getvsum(lc,tarl,tarr,l,mid,k);
    if(tarr>mid) sum += getvsum(rc,tarl,tarr,mid+1,r,k);
    pushup(rt);
    return sum;
}

void solve() {
    int n,q;
    cin>>n>>q;
    for(int i=1;i<=n;i++) {
        cin>>C[i];
    }
    for(int i=1;i<=n;i++) {
        cin>>V[i];
    }
    build(1,1,n);
    while(q--) {
        int op;
        cin>>op;
        if(op == 1) {
            int pos,x;
            cin>>pos>>x;
            int prec = C[pos];
            cchange(pos,1,1,n,x,prec);
        }
        if(op == 2) {
            int pos,x;
            cin>>pos>>x;
            vchange(pos,1,1,n,x);
        }
        if(op == 3) {
            int x,k;
            cin>>x>>k;
            for(int i=1;i<=k;i++) {
                cin>>a[i];
            }
            int l=1,r=x;
            while (l<r) {
                int mid = (l+r)>>1;
                bool ans = getcsum(1,mid,x,1,n,k);
                if(ans) r = mid;
                else l= mid + 1;
            }
            int L = l;
            l=x,r=n;
            while (l<r) {
                int mid = (l+r+1)>>1;
                bool ans = getcsum(1,x,mid,1,n,k);
                if(ans) l = mid;
                else r = mid - 1;
            }
            int R = l;
           cout<<getvsum(1,L,R,1,n,k)<<'\n';
        }
    }

}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int __t=1;
    cin>>__t;
    while(__t--) {
        solve();
    }
    return 0;
}