恭喜獲得 最速被擊破獎??

/* Local File
in_out/in.in
in_out/out.out
*/
#include <bits/stdc++.h>
using namespace std;
using llt = long long;
using ull = unsigned long long;
using llf = long double;
#define endl '\n'
 
const int N = 1e5 + 3, W = 64, D = N / W + 1, B = 600, S = N / B + 3;
int n, m, q, va[N], vb[N], pa[N], pb[N];

class Bset{
private:
	ull o[D];
public:
	bool operator[](int p) const{
		int l = p / W, r = p - l * W;
		return (o[l] >> r) & 1;
	}
	ull &operator()(int p){
		return o[p]; 
	}
	void Set(int p){
		int l = p >> 6, r = p - l * W;
		o[l] = o[l] | (1ull << r);
	}
	void Res(int p){
		int l = p >> 6, r = p - l * W;
		o[l] = o[l] & ~(1ull << r);
	}
	Bset &operator|=(const Bset &_){
		for(int i = 0; i < D; ++i)
			o[i] |= _.o[i];
		return *this;
	}
	Bset operator|(const Bset &_) const{
		Bset r(*this);
		return r |= _;
	}
	Bset &operator^=(const Bset &_){
		for(int i = 0; i < D; ++i)
			o[i] ^= _.o[i];
		return *this;
	}
	Bset operator^(const Bset &_) const{
		Bset r(*this);
		return r ^= _;
	}
	Bset &operator&=(const Bset &_){
		for(int i = 0; i < D; ++i)
			o[i] &= _.o[i];
		return *this;
	}
	Bset operator&(const Bset &_) const{
		Bset r(*this);
		return r &= _;
	}
};

Bset sn[N], ca[S], cb[S];
int bln, id[N], bl[N], br[N];

struct Gph{
	vector<int> to[N];
	void Add(int u, int v){
		to[u].emplace_back(v);
	}
	void ADD(int u, int v){
		Add(u, v), Add(v, u);
	}
	void Clr(){
		for(int i = 1; i <= n; ++i)
			to[i].clear();
	}
#define For_to(u, v, g) for(auto v : g.to[u])
} g, rg;

int rd[N];
void Solve(){
	cin >> n >> m >> q;
	for(int i = 1; i <= m; ++i){
		int u, v; cin >> u >> v;
		g.Add(u, v), ++rd[u], rg.Add(v, u);
	}
	for(int i = 1; i <= n; ++i)
		cin >> va[i], pa[va[i]] = i;
	for(int i = 1; i <= n; ++i)
		cin >> vb[i], pb[vb[i]] = i;
	queue<int> que;
	for(int i = 1; i <= n; ++i) if(!rd[i])
		que.emplace(i);
	while(!que.empty()){
		int u = que.front(); que.pop();
		sn[u].Set(u);
		For_to(u, v, g) sn[u] |= sn[v];
		For_to(u, v, rg)
			if(!--rd[v]) que.emplace(v);
	}
	bln = 0;
	for(int l = 1; l <= n; l += B){
		++bln;
		for(int j = bl[bln] = l, r = br[bln] = min(l + B - 1, n); j <= r; ++j)
			ca[bln].Set(pa[j]), cb[bln].Set(pb[j]), id[j] = bln;
	}
	for(int i = bln - 1; i; --i)
		ca[i] |= ca[i + 1], cb[i] |= cb[i + 1];
	for(int tst = 1; tst <= q; ++tst){
		int op; cin >> op;
		if(op == 1){
			int x, y; cin >> x >> y;
			int ix = id[va[x]], iy = id[va[y]];
			swap(va[x], va[y]), pa[va[x]] = x, pa[va[y]] = y;
			for(int i = 1; i <= ix; ++i) ca[i].Res(x);
			for(int i = 1; i <= iy; ++i) ca[i].Set(x);
			for(int i = 1; i <= iy; ++i) ca[i].Res(y);
			for(int i = 1; i <= ix; ++i) ca[i].Set(y);
		}else if(op == 2){
			int x, y; cin >> x >> y;
			int ix = id[vb[x]], iy = id[vb[y]];
			swap(vb[x], vb[y]), pb[vb[x]] = x, pb[vb[y]] = y;
			for(int i = 1; i <= ix; ++i) cb[i].Res(x);
			for(int i = 1; i <= iy; ++i) cb[i].Set(x);
			for(int i = 1; i <= iy; ++i) cb[i].Res(y);
			for(int i = 1; i <= ix; ++i) cb[i].Set(y);
		}else{
			int u, l, r; cin >> u >> l >> r;
			int il = id[l], ir = id[r];
			Bset k(ca[il] ^ ca[ir]);
			for(int i = bl[ir]; i <= r; ++i) k.Set(pa[i]);
			for(int i = bl[il]; i < l; ++i) k.Res(pa[i]);
			k &= sn[u];
			int p = 0;
			for(int i = 0; i < D; ++i)
				while(p < bln && (cb[p + 1](i) & k(i))) ++p;
			if(!p) cout << 0 << endl;
			else
				for(int i = br[p]; i >= bl[p]; --i){
					int p = pb[i];
					if(k[p]){
						cout << i << endl;
						break;
					}
				}
		}
	}
}

void Clear(){
	memset(sn, 0, sizeof sn);
	memset(ca, 0, sizeof ca);
	memset(cb, 0, sizeof cb);
	g.Clr(), rg.Clr();
}

int main(){
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
	int c, t; cin >> c >> t;
	while(t--) Solve(), Clear();
}