#include<bits/stdc++.h>
using std::cin;
using std::cout;
using namespace std;
#define cs const
#define pb push_back
const int N = 100005;
const int mod = 963724301;
using ll = long long; 
using u64 = unsigned long long;
using pr = std::pair<u64, u64>;
u64 add(u64 x, u64 y) {
	if(x > y) std::swap(x, y);
	static std::map<pr, u64> map;
	pr a(x, y);
	if(map.count(a)) return map[a];
	cout << "A " << x << ' ' << y << std::endl;
	u64 res; cin >> res;
	return map[a] = res;
}
u64 cmp(u64 x, u64 y) {
	if(x > y) std::swap(x, y);
	static std::map<pr, u64> map;
	pr a(x, y);
	if(map.count(a)) return map[a];
	cout << "C " << x << ' ' << y << std::endl;
	u64 res; cin >> res;
	return map[a] = res;
}
int n, q, B;
struct sgt {
	u64 sum[N << 2];
	void build(int cur, int l, int r, u64 * a) {
		if(l == r) {
			sum[cur] = a[l];
			return ;
		}
		int mid = (l + r) >> 1;
		build(cur << 1, l, mid, a);
		build(cur << 1 | 1, mid + 1, r, a);
		sum[cur] = add(sum[cur << 1], sum[cur << 1 | 1]);
	}
	void upt(int cur, int pos, u64 v, int l = 1, int r = n) {
		if(l == r) {
			sum[cur] = v;
			return ;
		}
		int mid = (l + r) >> 1;
		if(pos <= mid) {
			upt(cur << 1, pos, v, l, mid);
		} else {
			upt(cur << 1 | 1, pos, v, mid + 1, r);
		}
		sum[cur] = add(sum[cur << 1], sum[cur << 1 | 1]);
	}
	void init(u64 * a) {
		build(1, 1, n, a);
	}
} s[2];
int op[N], t[N], pos[N], k[N];
u64 x[N];
u64 a[N], b[N];
struct node {
	sgt * s; int cur, l, r; u64 pre;
	int leaf() const {
		return l == r;
	}
	u64 lpre() const {
		return l == 1 ? s -> sum[cur << 1] : add(pre, s -> sum[cur << 1]);
	}
	u64 all() const {
		return l == 1 ? s -> sum[cur] : add(pre, s -> sum[cur]);
	}
	node ls() const {
		int mid = (l + r) >> 1;
		return {s, cur << 1, l, mid, pre};
	}
	node rs() const {
		int mid = (l + r) >> 1;
		return {s, cur << 1| 1, mid + 1, r, lpre()};
	}
	int lc() const {
		int mid = (l + r) >> 1;
		return mid - l + 1;
	}
};
u64 qry(node x, node y, int k) {
	if(x.leaf() && y.leaf()) {
		u64 xa = x.all();
		u64 ya = y.all();
		u64 min = cmp(xa, ya);
		if(k == 1) {
			return min;
		} else {
			return xa ^ ya ^ min;
		}
	}
	if(y.leaf()) std::swap(x, y);
	if(!x.leaf()) {
		u64 xa = x.lpre();
		u64 ya = y.lpre();
		u64 min = cmp(xa, ya);
		if(min != xa) {
			std::swap(xa, ya);
			std::swap(x, y);
		}
		if(x.lc() + y.lc() <= k) {
			return qry(x.rs(), y, k - x.lc());
		} else {
			return qry(x, y.ls(), k);
		}
	} else {
		u64 xa = x.all();
		u64 ya = y.lpre();
		int c = y.lc();
		c += cmp(xa, ya) == xa;
		if(k <= c) {
			return qry(x, y.ls(), k);
		} else {
			return qry(x, y.rs(), k - y.lc());
		}

	}
}
std::mt19937 gen;
int main() {
	cin >> n >> q >> B;
	for(int i = 1;i <= n;++i) {
		cin >> a[i];
	}
	for(int i = 1;i <= n;++i) {
		cin >> b[i];
	}
	for(int i = 1;i <= q;++i) {
		cin >> op[i];
		if(op[i] == 1) {
			cin >> t[i] >> pos[i] >> x[i];
		} else {
			cin >> k[i];
		}
	}
	/*
	for(int i = 1;i <= n;++i) {
		a[i] = gen() % 10;
	}
	for(int i = 1;i <= n;++i) {
		b[i] = gen() % 10;
	}
	for(int i = 1;i <= q;++i) {
		if(gen() & 1) {
			op[i] = 1;
			t[i] = gen() % 2 + 1;
			pos[i] = gen() % n + 1;
			x[i] = gen() % 10;
		} else {
			k[i] = gen() % (n + n) + 1;
		}
	}
	*/
	s[0].init(a);
	s[1].init(b);
	std::vector<u64> ans;
	for(int i = 1;i <= q;++i) {
		if(op[i] == 1) {
			s[t[i] - 1].upt(1, pos[i], x[i]);
			(t[i] == 1 ? a : b)[pos[i]] = x[i];
		} else {
			std::vector<u64> su;
			if(0) {
				u64 s = 0;
				for(int i = 1;i <= n;++i) su.push_back(s += a[i]);
				s = 0;
				for(int i = 1;i <= n;++i) su.push_back(s += b[i]);
				sort(su.begin(), su.end());
			}
			ans.push_back(qry({s, 1, 1, n, 0}, {s + 1, 1, 1, n, 0}, k[i]));
			// assert(ans.back() == su[k[i] - 1]);
		}
	}
	cout << "! " << ans.size() << '\n';
	for(u64 x : ans) cout << x << ' ';
}