#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
template<typename T>
inline bool cmax(T&x,const T& y){return x<y?x=y,1:0;}
template<typename T>
inline bool cmin(T&x,const T& y){return y<x?x=y,1:0;}
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vector<int> > vii; 
typedef unsigned long long ull;
#define sz(x) (int(x.size()))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
#define em emplace
#define X first
#define Y second
const int mod=998244353;
inline void MOD(int&x){x-=mod,x+=x>>31&mod;}
inline void MOD(ll& x){x-=mod,x+=x>>63&mod;}
inline int add(int x,int y){MOD(x+=y);return x;}
inline int mul(int x,int y){return 1ll*x*y%mod;}
template<typename ... A>inline int mul(const int& x,const A&... p){return 1ll*x*mul(p...)%mod;}
inline ll ksm(ll a,ll p=mod-2){ll ans=1;for(;p;p>>=1,a=a*a%mod)if(p&1)ans=ans*a%mod;return ans;}
typedef long double LD;
const int MAXN=1e5+10;
int c[MAXN],a[MAXN];
int N;
struct BIT
{
    ll t[MAXN];
    inline void add(int x,int k){for(;x<=N;x+=x&-x)t[x]+=k;}
    inline ll ask(int x){ll ans=0;for(;x;x-=x&-x)ans+=t[x];return ans;}
    inline ll ask(int l,int r){return ask(r)-ask(l-1);}
}bt;
inline ll getid(ll x,ll y){return (x-1)*N+y;}
cc_hash_table<ll,int>t;
inline void add(int x,int y,int k)
{
    for(;y<=N;y+=y&-y)t[getid(x,y)]+=k;
}
inline int ask(vi& ve,int y)
{
    int ans=0;
    for(;y;y-=y&-y)
    {
        for(auto&x:ve)ans+=t[getid(x,y)];
    }
    return ans;
}
int M;
inline int findl(vi& ve,int x)
{
    int sum=ask(ve,x);
    if(sum==x)return 1;
    int tot=0,u=0;
    for(int i=M;i;i>>=1)
    {
        int nxt=u|i;
        int res=0;
        for(auto&p:ve)
        {
            auto ii=t.find(getid(p,nxt));
            if(ii!=t.end())res+=ii->second;
        }
        if(nxt<=x&&sum-(res+tot)!=x-nxt)u=nxt,tot+=res;
    }
    return u+2;
}
inline int findr(vi&ve,int x)
{
    auto b=ask(ve,x);
    int u=0,tot=0;
    for(int i=M;i;i>>=1)
    {
        int nxt=u|i;
        int res=0;
        for(auto&p:ve)
        {
            auto ii=t.find(getid(p,nxt));
            if(ii!=t.end())res+=ii->second;
        }
        if(nxt<x||(tot+res)-b==nxt-x)u=nxt,tot+=res;
    }
    return u;
}
inline void solve()
{
    t.clear();
    int n,m;cin>>n>>m;N=n;
    for(int i=1;i<=n;i++)cin>>c[i];
    for(int i=1;i<=n;i++)bt.t[i]=0;
    for(int i=1;i<=n;i++)cin>>a[i],bt.add(i,a[i]),add(c[i],i,1);
    M=1;while(M<=n)M<<=1;
    while(m--)
    {
        int op,x,y;
        cin>>op;
        if(op==1)
        {
            cin>>x>>y;
            add(c[x],x,-1);
            add(c[x]=y,x,1);
        }
        else if(op==2)
        {
            cin>>x>>y;
            bt.add(x,-a[x]);
            bt.add(x,a[x]=y);
        }
        else
        {
            vi ve;cin>>x>>y;ve.resize(y);
            for(auto&p:ve)cin>>p;
          //  cerr<<findl(ve,x)<<' '<<findr(ve,x)<<'\n';
            cout<<bt.ask(findl(ve,x),findr(ve,x))<<'\n';
        }
    }
}
int main()
{
    
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);cout<<fixed<<setprecision(10);
	int T;cin>>T;while(T--)solve();
	return 0;
}