#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


// #define DEB

using U = unsigned long long;

int cntAdd, cntCmp;
U add(U x, U y) {
#ifdef DEB
  ++cntAdd;
  return x + y;
#else
  if (!x) return y;
  if (!y) return x;
  if (x > y) swap(x, y);
  static map<pair<U, U>, U> cache;
  auto it = cache.find(make_pair(x, y));
  if (it != cache.end()) return it->second;
  printf("A %llu %llu\n", x, y); fflush(stdout);
  U z; scanf("%llu", &z);
  return cache[make_pair(x, y)] = z;
#endif
}
U cmp(U x, U y) {
#ifdef DEB
  ++cntCmp;
  return min(x, y);
#else
  if (!x) return 0;
  if (!y) return 0;
  if (x > y) swap(x, y);
  static map<pair<U, U>, U> cache;
  auto it = cache.find(make_pair(x, y));
  if (it != cache.end()) return it->second;
  printf("C %llu %llu\n", x, y); fflush(stdout);
  U z; scanf("%llu", &z);
  return cache[make_pair(x, y)] = z;
#endif
}

int N, Q, B;
vector<U> A[2];
vector<int> O, H, I, K;
vector<U> X;

int segN;
vector<int> L, R;
vector<U> seg[2];

U get(int h, int l, int e) {
  const int r = l + (1 << e);
  const int u = (segN >> e) + (l >> e);
  assert(L[u] == l);
  assert(R[u] == r);
  return seg[h][u];
}

int main() {
  scanf("%d%d%d", &N, &Q, &B);
  for (int h = 0; h < 2; ++h) {
    A[h].resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%llu", &A[h][i]);
    }
  }
  O.assign(Q, -1);
  H.assign(Q, -1);
  I.assign(Q, -1);
  X.assign(Q, -1);
  K.assign(Q, -1);
  for (int q = 0; q < Q; ++q) {
    scanf("%d", &O[q]);
    if (O[q] == 1) {
      scanf("%d%d%llu", &H[q], &I[q], &X[q]);
      --H[q];
      --I[q];
    } else {
      scanf("%d", &K[q]);
    }
  }
  
  for (segN = 1; segN < N; segN <<= 1) {}
  L.assign(segN << 1, -1);
  R.assign(segN << 1, -1);
  for (int i = 0; i < segN; ++i) {
    L[segN + i] = i;
    R[segN + i] = i + 1;
  }
  for (int u = segN; --u; ) {
    L[u] = L[u << 1];
    R[u] = R[u << 1 | 1];
  }
  for (int h = 0; h < 2; ++h) {
    seg[h].assign(segN << 1, 0);
    for (int i = 0; i < N; ++i) {
      seg[h][segN + i] = A[h][i];
    }
    for (int u = segN; --u; ) {
      seg[h][u] = add(seg[h][u << 1], seg[h][u << 1 | 1]);
    }
// cerr<<"seg["<<h<<"] = "<<seg[h]<<endl;
  }
  
  vector<U> anss;
  for (int q = 0; q < Q; ++q) {
    if (O[q] == 1) {
      const int h = H[q];
      const int i = I[q];
      A[h][i] = X[q];
      int u = segN + i;
      seg[h][u] = X[q];
      for (; u >>= 1; ) {
        seg[h][u] = add(seg[h][u << 1], seg[h][u << 1 | 1]);
      }
    } else {
// cerr<<COLOR("33")<<"query "<<K[q]<<COLOR()<<endl;
      U ans = -1;
      int k = K[q];
      int xs[2] = {};
      U ss[2] = {};
      for (; ; ) {
// cerr<<"k = "<<k<<", xs = "<<xs[0]<<" "<<xs[1]<<", ss = "<<ss[0]<<" "<<ss[1]<<endl;
        assert(k >= 1);
        int e = 31 - __builtin_clz(k);
        if (e) --e;
        // A[h][0, xs[h] + 2^e)
        auto calc = [&](int h) -> U {
          const U res = get(h, xs[h], e);
          return add(ss[h], res);
        };
        auto adv = [&](int h) -> void {
          ss[h] = calc(h);
          xs[h] += (1 << e);
          k -= (1 << e);
        };
        if (xs[0] + (1 << e) <= N) {
          if (xs[1] + (1 << e) <= N) {
            U ts[2];
            for (int h = 0; h < 2; ++h) ts[h] = calc(h);
            if (ts[0] == ts[1]) {
              if ((1 << e) + (1 << e) >= k) {
                ans = ts[0];
                break;
              } else {
                adv(0);
                adv(1);
              }
            } else {
              const U mn = cmp(ts[0], ts[1]);
              if (k == 1) {
                ans = mn;
                break;
              } else {
                if (mn == ts[0]) {
                  adv(0);
                } else {
                  adv(1);
                }
              }
            }
          } else {
            if (k == 1) {
              ans = calc(0);
              break;
            } else {
              adv(0);
            }
          }
        } else {
          if (xs[1] + (1 << e) <= N) {
            if (k == 1) {
              ans = calc(1);
              break;
            } else {
              adv(1);
            }
          } else {
            assert(false);
          }
        }
      }
      anss.push_back(ans);
    }
  }
#ifdef DEB
cerr<<"cntAdd = "<<cntAdd<<endl;
cerr<<"cntCmp = "<<cntCmp<<endl;
#endif
  
  printf("! %d\n", (int)anss.size());
  for (int i = 0; i < (int)anss.size(); ++i) {
    if (i) printf(" ");
    printf("%llu", anss[i]);
  }
  puts("");
  fflush(stdout);
  return 0;
}