#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long 
#define vi vector < int > 
#define sz(a) ((int) (a).size())
#define ll long long 
#define ull unsigned long long
#define me(a, x) memset(a, x, sizeof(a)) 
using namespace std;
const int N = 1e5 + 7;

struct Data {
	ull x;
	Data (ull X = 0) {
		x = X;
	}
};

map < pair < ull, ull >, Data > Add;
map < pair < ull, ull >, bool > Cmp;
Data operator + (Data u, Data v) {
	if(u.x == 0 || v.x == 0) return Data(u.x + v.x); 
	if(Add.count(make_pair(u.x, v.x))) return Add[make_pair(u.x, v.x)];
//	return Data(u.x + v.x); // delete
	cout << "A " << u.x << ' ' << v.x << endl;
	
	ull w;
	cin >> w;
	return Add[make_pair(u.x, v.x)] = Data(w);
}

bool operator < (Data u, Data v) {
	if(u.x == v.x) return false;
	if(Cmp.count(make_pair(u.x, v.x))) return Cmp[make_pair(u.x, v.x)];
//	return u.x < v.x; // delete
	
	cout << "C " << u.x << ' ' << v.x << endl;
	ull w;
	cin >> w;
	return Cmp[make_pair(u.x, v.x)] = w == u.x;
}

int n, q, B;
int type[N], qk[N], qt[N], qpos[N];
ull qx[N];

struct ds {
	Data cm[20][N];
	void build(ull *a) {
		L(i, 0, n - 1) {
			cm[0][i] = Data(a[i]);
		}
		L(h, 1, 19) {
			for(int i = 0; i < n; i += 1 << h) {
				if(i + (1 << h) - 1 >= n) {
					continue;
				}
				cm[h][i] = cm[h - 1][i] + cm[h - 1][i + (1 << (h - 1))];
			}
		}
	}
	void modify(int p, ull w) {
		cm[0][p] = Data(w);
		L(h, 1, 19) {
			int i = (p >> h) << h;
			if((i + (1 << h) - 1) >= n) {
				continue;
			}
			cm[h][i] = cm[h - 1][i] + cm[h - 1][i + (1 << (h - 1))];
		}
	}
} ds1, ds2;

ull va[N], vb[N];
int main() {
	ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n >> q >> B;
	L(i, 0, n - 1) {
		cin >> va[i];
	}
	L(i, 0, n - 1) {
		cin >> vb[i];
	}
	L(t, 1, q) {
		cin >> type[t];
		if(type[t] == 1) {
			cin >> qt[t] >> qpos[t] >> qx[t], --qpos[t];
		} else {
			cin >> qk[t];
		}
	}
	ds1.build(va);
	ds2.build(vb);
	
	vector < ull > ans;
	L(t, 1, q) {
		if(type[t] == 1) {
			if(qt[t] == 1) {
				ds1.modify(qpos[t], qx[t]);
				va[qpos[t]] = qx[t];
			} else {
				ds2.modify(qpos[t], qx[t]);
				vb[qpos[t]] = qx[t];
			}
		} else if(type[t] == 2) {
			int k = qk[t];
			
//			cout << "values : " << endl;
//			L(i, 0, n - 1) {
//				cout << va[i] << ' ';
//			}
//			cout << endl;
//			L(i, 0, n - 1) {
//				cout << vb[i] << ' ';
//			}
//			cout << endl;
//			cout << "query : k = " << k << endl;
			int pos[2] = {0, 0};
			Data sum[2] = {0, 0};
			
			int curh = 20;
			while(k > 1) {
				while((1 << (curh + 1)) > k)
					--curh;
				if(pos[0] + (1 << curh) - 1 >= n) {
					sum[1] = sum[1] + ds2.cm[curh][pos[1]];
					pos[1] += 1 << curh;
				} else if(pos[1] + (1 << curh) - 1 >= n) {
					sum[0] = sum[0] + ds1.cm[curh][pos[0]];
					pos[0] += 1 << curh;
				} else {
					if(sum[0] + ds1.cm[curh][pos[0]] < sum[1] + ds2.cm[curh][pos[1]]) {
						sum[0] = sum[0] + ds1.cm[curh][pos[0]];
						pos[0] += 1 << curh;
					} else {
						sum[1] = sum[1] + ds2.cm[curh][pos[1]];
						pos[1] += 1 << curh;
					}
				}
				k -= 1 << curh;
			}
			if(pos[0] == n) 
				ans.emplace_back((sum[1] + ds2.cm[0][pos[1]]).x);
			else if(pos[1] == n) 
				ans.emplace_back((sum[0] + ds1.cm[0][pos[0]]).x);
			else 
				ans.emplace_back(
					min(sum[0] + ds1.cm[0][pos[0]], sum[1] + ds2.cm[0][pos[1]]).x); 
		}
	} 
	
	cout << "! " << sz(ans) << endl;
	for(auto&u : ans) cout << u << ' ';
	cout << endl;
	return 0;
}

/*
2 3 2
1 3
5 7
2 3
1 2 2 9
2 1

*/