#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 <random>
#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")


////////////////////////////////////////////////////////////////////////////////
// SA-IS
//   String: string, vector<int>, vector<long long>
//   if sigma <= n,  O(n) time, O(n) space
//   if sigma >  n,  O(n log n) time, O(n) space
template <class String> vector<int> suffixArrayRec(const String &as) {
  const int n = as.size();
  if (n == 0) return {};
  const auto minmaxA = minmax_element(as.begin(), as.end());
  const auto minA = *minmaxA.first, maxA = *minmaxA.second;
  if (static_cast<unsigned long long>(maxA) - minA >=
      static_cast<unsigned long long>(n)) {
    vector<int> us(n);
    for (int u = 0; u < n; ++u) us[u] = u;
    std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
      return (as[u] < as[v]);
    });
    int b = 0;
    vector<int> bs(n, 0);
    for (int i = 1; i < n; ++i) {
      if (as[us[i - 1]] != as[us[i]]) ++b;
      bs[us[i]] = b;
    }
    return suffixArrayRec(bs);
  }
  const int sigma = maxA - minA + 1;
  vector<int> pt(sigma + 1, 0), poss(sigma);
  for (int u = 0; u < n; ++u) ++pt[as[u] - minA + 1];
  for (int a = 0; a < sigma; ++a) pt[a + 1] += pt[a];
  // cmp[u] := (as[u, n) < as[u + 1, n))
  vector<bool> cmp(n);
  cmp[n - 1] = false;
  for (int u = n - 1; --u >= 0; ) {
    cmp[u] = (as[u] != as[u + 1]) ? (as[u] < as[u + 1]) : cmp[u + 1];
  }
  // ><,  nn - id (0 <= id < n)
  int nn = 0;
  vector<int> ids(n, 0);
  int last = n;
  vector<int> nxt(n, 0);
  // put ><, from the tail of each bucket
  vector<int> us(n, 0);
  memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
  for (int u = n - 1; --u >= 1; ) if (!cmp[u - 1] && cmp[u]) {
    ids[u] = ++nn;
    nxt[u] = last;
    last = u;
    us[--poss[as[u] - minA]] = u;
  }
  // follow > backwards, from the head of each bucket
  memcpy(poss.data(), pt.data(), sigma * sizeof(int));
  us[poss[as[n - 1] - minA]++] = n - 1;
  for (int i = 0; i < n; ++i) {
    const int u = us[i];
    if (u && !cmp[u - 1]) us[poss[as[u - 1] - minA]++] = u - 1;
  }
  // follow < backwards, from the tail of each bucket
  memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
  for (int i = n; --i >= 0; ) {
    const int u = us[i];
    if (u && cmp[u - 1]) us[--poss[as[u - 1] - minA]] = u - 1;
  }
  if (nn) {
    int vsLen = 0;
    vector<int> vs(nn);
    for (const int u : us) if (ids[u]) vs[vsLen++] = u;
    int b = 0;
    vector<int> bs(nn, 0);
    for (int j = 1; j < nn; ++j) {
      // as[v1, w1] (< or =) as[v0, w0]
      int v1 = vs[j - 1], v0 = vs[j];
      const int w1 = nxt[v1], w0 = nxt[v0];
      if (w1 - v1 != w0 - v0) {
        ++b;
      } else {
        for (; ; ++v1, ++v0) {
          if (v1 == n) { ++b; break; }
          if (as[v1] != as[v0]) { ++b; break; }
          if (v1 == w1) break;
        }
      }
      bs[nn - ids[vs[j]]] = b;
    }
    for (int u = 0; u < n; ++u) if (ids[u]) vs[nn - ids[u]] = u;
    const auto sub = suffixArrayRec(bs);
    // put ><, from the tail of each bucket
    memset(us.data(), 0, n * sizeof(int));
    memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
    for (int j = nn; --j >= 0; ) {
      const int u = vs[sub[j]];
      us[--poss[as[u] - minA]] = u;
    }
    // follow > backwards, from the head of each bucket
    memcpy(poss.data(), pt.data(), sigma * sizeof(int));
    us[poss[as[n - 1] - minA]++] = n - 1;
    for (int i = 0; i < n; ++i) {
      const int u = us[i];
      if (u && !cmp[u - 1]) us[poss[as[u - 1] - minA]++] = u - 1;
    }
    // follow < backwards, from the tail of each bucket
    memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
    for (int i = n; --i >= 0; ) {
      const int u = us[i];
      if (u && cmp[u - 1]) us[--poss[as[u - 1] - minA]] = u - 1;
    }
  }
  return us;
}

// us[i]: i-th suffix
// su[u]: index of as[u, n)
// hs[i]: longest common prefix of as[us[i - 1], n) and as[us[i], n)
struct SuffixArray {
  int n;
  bool rmq;
  vector<int> us, su, hs, bsr;
  SuffixArray() : n(0), rmq(false) {}
  SuffixArray(const string &as, bool rmq_) : rmq(rmq_) { build(as); }
  SuffixArray(const vector<int> &as, bool rmq_) : rmq(rmq_) { build(as); }
  SuffixArray(const vector<long long> &as, bool rmq_) : rmq(rmq_) { build(as); }
  template <class String> void build(const String &as) {
    n = as.size();
    us = suffixArrayRec(as);
    su.resize(n + 1);
    for (int i = 0; i < n; ++i) su[us[i]] = i;
    su[n] = -1;
    hs.assign(n, 0);
    for (int h = 0, u = 0; u < n; ++u) if (su[u]) {
      for (int v = us[su[u] - 1]; v + h < n && as[v + h] == as[u + h]; ++h) {}
      hs[su[u]] = h;
      if (h) --h;
    }
    if (rmq) {
      const int logN = n ? (31 - __builtin_clz(n)) : 0;
      hs.resize((logN + 1) * n - (1 << logN) + 1);
      for (int e = 0; e < logN; ++e) {
        int *hes = hs.data() + e * n;
        for (int i = 0; i <= n - (1 << (e + 1)); ++i) {
          hes[n + i] = min(hes[i], hes[i + (1 << e)]);
        }
      }
      bsr.resize(n + 1);
      bsr[0] = -1;
      for (int i = 1; i <= n; ++i) bsr[i] = bsr[i >> 1] + 1;
    }
  }
  // Returns longest common prefix of as[u, n) and as[v, n).
  //   0 <= u, v <= n
  //   Assumes rmq.
  inline int lcp(int u, int v) const {
    if (u == v) return n - u;
    int i = su[u], j = su[v];
    if (i > j) swap(i, j);
    const int e = bsr[j - i];
    return min(hs[e * n + i + 1], hs[e * n + j + 1 - (1 << e)]);
  }
};
////////////////////////////////////////////////////////////////////////////////


// zs[i] := lcp(as[0, n), as[i, n))
// 0    i-j     j     i
// |-------|    |-------|    zs[j]
// |---| |---|  |---| |---|  zs[i-j]
template <class T> void suffixZ(const T *as, int n, int *zs) {
  if (n == 0) return;
  zs[0] = 0;
  for (int j = 0, i = 1; i < n; ++i) {
    if (i + zs[i - j] < j + zs[j]) {
      zs[i] = zs[i - j];
    } else {
      int &z = zs[i] = max(j + zs[j] - i, 0);
      for (; i + z < n && as[z] == as[i + z]; ++z) {}
      j = i;
    }
  }
  zs[0] = n;
}
template <class T> vector<int> suffixZ(const T &as) {
  vector<int> zs(as.size());
  suffixZ(as.data(), as.size(), zs.data());
  return zs;
}

////////////////////////////////////////////////////////////////////////////////


template <class X, class Y, class T> struct StaticPointAddRectSum {
  struct Rect {
    X x0, x1;
    Y y0, y1;
  };
  vector<pair<X, Y>> as;
  vector<Rect> bs;
  vector<T> vals, anss;
  // Adds val to (x, y).
  void add(X x, Y y, const T &val) {
    as.emplace_back(x, y);
    vals.push_back(val);
  }
  // Gets sum of [x0, x1) * [y0, y1).
  //   ~~> Gets (x*, y*)
  void get(X x0, X x1, Y y0, Y y1) {
    assert(x0 <= x1); assert(y0 <= y1);
    bs.push_back(Rect{x0, x1, y0, y1});
  }

  void run() {
    const int asLen = as.size(), bsLen = bs.size();

    // same x ==> get then add
    vector<pair<X, int>> events((bsLen << 1) + asLen);
    for (int i = 0; i < asLen; ++i) {
      events[(bsLen << 1) + i] = std::make_pair(as[i].first, (bsLen << 1) + i);
    }
    for (int j = 0; j < bsLen; ++j) {
      events[j << 1    ] = std::make_pair(bs[j].x0, j << 1    );
      events[j << 1 | 1] = std::make_pair(bs[j].x1, j << 1 | 1);
    }
    std::sort(events.begin(), events.end());

    vector<Y> ys(asLen);
    for (int i = 0; i < asLen; ++i) {
      ys[i] = as[i].second;
    }
    std::sort(ys.begin(), ys.end());
    ys.erase(std::unique(ys.begin(), ys.end()), ys.end());
    const int ysLen = ys.size();
    vector<T> bit(ysLen, 0);

    anss.assign(bsLen, 0);
    for (const auto &event : events) {
      if (event.second >= bsLen << 1) {
        const int i = event.second - (bsLen << 1);
        for (int l = std::lower_bound(ys.begin(), ys.end(), as[i].second) - ys.begin(); l < ysLen; l |= l + 1) {
          bit[l] += vals[i];
        }
      } else {
        const int j = event.second >> 1;
        T sum = 0;
        for (int l = std::lower_bound(ys.begin(), ys.end(), bs[j].y0) - ys.begin(); l > 0; l &= l - 1) {
          sum -= bit[l - 1];
        }
        for (int l = std::lower_bound(ys.begin(), ys.end(), bs[j].y1) - ys.begin(); l > 0; l &= l - 1) {
          sum += bit[l - 1];
        }
        (event.second & 1) ? (anss[j] += sum) : (anss[j] -= sum);
      }
    }
  }
};

////////////////////////////////////////////////////////////////////////////////

// T: monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class T> struct SegmentTreePoint {
  int logN, n;
  vector<T> ts;
  SegmentTreePoint() : logN(0), n(0) {}
  explicit SegmentTreePoint(int n_) {
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
  }
  template <class S> explicit SegmentTreePoint(const vector<S> &ss) {
    const int n_ = ss.size();
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
    for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);
    build();
  }
  T &at(int i) {
    return ts[n + i];
  }
  void build() {
    for (int u = n; --u; ) pull(u);
  }

  inline void pull(int u) {
    ts[u].pull(ts[u << 1], ts[u << 1 | 1]);
  }

  // Changes the value of point a to s.
  template <class S> void change(int a, const S &s) {
    assert(0 <= a); assert(a < n);
    ts[a += n] = T(s);
    for (; a >>= 1; ) pull(a);
  }

  // Applies T::f(args...) to point a.
  template <class F, class... Args>
  void ch(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a < n);
    (ts[a += n].*f)(args...);
    for (; a >>= 1; ) pull(a);
  }

  // Calculates the product for [a, b).
  T get(int a, int b) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return T();
    a += n; b += n;
    T prodL, prodR, t;
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) { t.pull(prodL, ts[aa++]); prodL = t; }
      if (bb & 1) { t.pull(ts[--bb], prodR); prodR = t; }
    }
    t.pull(prodL, prodR);
    return t;
  }

  // Calculates T::f(args...) of a monoid type for [a, b).
  //   op(-, -)  should calculate the product.
  //   e()  should return the identity.
  template <class Op, class E, class F, class... Args>
#if __cplusplus >= 201402L
  auto
#else
  decltype((std::declval<T>().*F())())
#endif
  get(int a, int b, Op op, E e, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return e();
    a += n; b += n;
    auto prodL = e(), prodR = e();
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) prodL = op(prodL, (ts[aa++].*f)(args...));
      if (bb & 1) prodR = op((ts[--bb].*f)(args...), prodR);
    }
    return op(prodL, prodR);
  }

  // Find min b s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from left to right.
  //   Returns n + 1 if there is no such b.
  template <class F, class... Args>
  int findRight(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a <= n);
    if ((T().*f)(args...)) return a;
    if (a == n) return n + 1;
    a += n;
    for (; ; a >>= 1) if (a & 1) {
      if ((ts[a].*f)(args...)) {
        for (; a < n; ) {
          if (!(ts[a <<= 1].*f)(args...)) ++a;
        }
        return a - n + 1;
      }
      ++a;
      if (!(a & (a - 1))) return n + 1;
    }
  }

  // Find max a s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from right to left.
  //   Returns -1 if there is no such a.
  template <class F, class... Args>
  int findLeft(int b, F f, Args &&... args) {
    assert(0 <= b); assert(b <= n);
    if ((T().*f)(args...)) return b;
    if (b == 0) return -1;
    b += n;
    for (; ; b >>= 1) if ((b & 1) || b == 2) {
      if ((ts[b - 1].*f)(args...)) {
        for (; b <= n; ) {
          if (!(ts[(b <<= 1) - 1].*f)(args...)) --b;
        }
        return b - n - 1;
      }
      --b;
      if (!(b & (b - 1))) return -1;
    }
  }
};

////////////////////////////////////////////////////////////////////////////////

constexpr int INF = 1001001001;

struct NodeCountMax {
  int mx, lz;
  int cnt;
  NodeCountMax() : mx(-INF), lz(0), cnt(0) {}
  NodeCountMax(int val) : mx(val), lz(0), cnt(1) {}
  void push(NodeCountMax &l, NodeCountMax &r) {
    if (lz) {
      l.add(lz);
      r.add(lz);
      lz = 0;
    }
  }
  void pull(const NodeCountMax &l, const NodeCountMax &r) {
    if (l.mx > r.mx) {
      mx = l.mx;
      cnt = l.cnt;
    } else if (l.mx < r.mx) {
      mx = r.mx;
      cnt = r.cnt;
    } else {
      mx = l.mx;
      cnt = l.cnt + r.cnt;
    }
  }
  void add(int val) {
    mx += val;
    lz += val;
  }
  // leaf
  void change(int val) {
    mx = val;
    cnt = 1;
  }
};


int ID;
int ALen, BLen;
vector<int> A, B;
int Q;
vector<int> O, Y, Z, Y2, Z2;

SuffixArray saB, saRevB;


namespace brute {
vector<pair<int, int>> run() {
  vector<pair<int, int>> ans(Q, make_pair(-1, -1));
  auto as = A;
#define A do_not_use_A
  for (int q = 0; q < Q; ++q) {
    switch (O[q]) {
      case 1: {
        as[Y[q]] = Z[q];
        for (int i = 0; i < ALen; ++i) {
          int l = 0;
          for (; i + l < ALen && l < BLen && as[i + l] == B[l]; ++l) {}
          if (chmax(ans[q].first, l)) ans[q].second = 0;
          if (ans[q].first == l) ++ans[q].second;
        }
// cerr<<as<<" "<<B<<": "<<ans[q]<<endl;
      } break;
      case 2: {
        for (int i = Y[q]; i < Z[q]; ++i) {
          int l = 0;
          for (; i + l < Z[q] && l < BLen && as[i + l] == B[l]; ++l) {}
          if (chmax(ans[q].first, l)) ans[q].second = 0;
          if (ans[q].first == l) ++ans[q].second;
        }
      } break;
      case 3: {
        int l = 0;
        for (; Y[q] + l < BLen && Z[q] + l < BLen && B[Y[q] + l] == B[Z[q] + l]; ++l) {}
        ans[q].first = l;
      } break;
      case 4: {
        vector<int> cat;
        cat.insert(cat.end(), B.begin() + Y[q], B.begin() + Z[q]);
        cat.insert(cat.end(), B.begin() + Y2[q], B.begin() + Z2[q]);
        const int catLen = cat.size();
        ans[q].first = 0;
        for (int i = 0; i + catLen <= BLen; ++i) {
          bool ok = true;
          for (int j = 0; j < catLen; ++j) if (B[i + j] != cat[j]) {
            ok = false;
            break;
          }
          if (ok) {
            ++ans[q].first;
          }
        }
      } break;
      default: assert(false);
    }
  }
#undef A
  return ans;
}
}  // brute


vector<int> solve3() {
  vector<int> ans(Q, -1);
  for (int q = 0; q < Q; ++q) if (O[q] == 3) {
    ans[q] = saB.lcp(Y[q], Z[q]);
  }
  return ans;
}

vector<int> solve4() {
  StaticPointAddRectSum<int, int, int> f;
  for (int i = 1; i < BLen; ++i) {
    f.add(saRevB.su[BLen - i], saB.su[i], +1);
  }
#define saB do_not_use_saB
#define saRevB do_not_use_saRevB
  // jL <= j < jR <=> [l, r) matches [sa.us[j], *)
  auto sub = [&](const SuffixArray &sa, int l, int r) -> pair<int, int> {
    pair<int, int> ret;
    {
      int lo = -1, hi = sa.su[l];
      for (; lo + 1 < hi; ) {
        const int mid = (lo + hi) / 2;
        ((sa.lcp(sa.us[mid], l) >= r - l) ? hi : lo) = mid;
      }
      ret.first = hi;
    }
    {
      int lo = sa.su[l], hi = sa.n;
      for (; lo + 1 < hi; ) {
        const int mid = (lo + hi) / 2;
        ((sa.lcp(l, sa.us[mid]) >= r - l) ? lo : hi) = mid;
      }
      ret.second = hi;
    }
    return ret;
  };
#undef saB
#undef saRevB
  for (int q = 0; q < Q; ++q) if (O[q] == 4) {
    const auto res1 = sub(saRevB, BLen - Z[q], BLen - Y[q]);
    const auto res2 = sub(saB, Y2[q], Z2[q]);
    f.get(res1.first, res1.second, res2.first, res2.second);
  }
  f.run();
  vector<int> ans(Q, 0);
  int pos = 0;
  for (int q = 0; q < Q; ++q) if (O[q] == 4) {
    ans[q] = f.anss[pos++];
  }
  return ans;
}


namespace slow {
vector<int> as;
vector<int> fs;
SegmentTreePoint<NodeCountMax> seg;
void init() {
  as = A;
  auto B0A = B;
  B0A.push_back(0);
  B0A.insert(B0A.end(), A.begin(), A.end());
  const auto zs = suffixZ(B0A);
  fs.resize(ALen);
  seg = SegmentTreePoint<NodeCountMax>(ALen);
  for (int i = 0; i < ALen; ++i) {
    seg.at(i) = fs[i] = zs[BLen + 1 + i];
  }
  seg.build();
}
#define A do_not_use_A
void block(int pos) {
  for (int i = max(pos - BLen + 1, 0); i <= pos; ++i) {
    if (chmin(fs[i], pos - i)) {
      seg.change(i, fs[i]);
    }
  }
}
void allow(int pos) {
  const int i0 = max(pos - BLen + 1, 0);
  auto b0a = B;
  b0a.push_back(0);
  b0a.insert(b0a.end(), as.begin() + i0, as.begin() + min(pos + BLen, ALen));
  const auto zs = suffixZ(b0a);
  for (int i = i0; i <= pos; ++i) {
    const int f = zs[BLen + 1 + i - i0];
    if (fs[i] != f) {
      seg.change(i, fs[i] = f);
    }
  }
}
pair<int, int> get(int l, int r) {
  const auto res = seg.get(l, r);
  return make_pair(res.mx, res.cnt);
}
#undef A
vector<pair<int, int>> run() {
  vector<pair<int, int>> ans(Q, make_pair(-1, -1));
  init();
  for (int q = 0; q < Q; ++q) {
    if (O[q] == 1) {
      if (as[Y[q]] != Z[q]) {
        block(Y[q]);
        as[Y[q]] = Z[q];
        allow(Y[q]);
      }
      ans[q] = get(0, ALen);
    } else if (O[q] == 2) {
      if (Z[q] < ALen) block(Z[q]);
      ans[q] = get(Y[q], Z[q]);
      if (Z[q] < ALen) allow(Z[q]);
    }
  }
  {
    const auto res = solve3();
    for (int q = 0; q < Q; ++q) if (O[q] == 3) ans[q].first = res[q];
  }
  {
    const auto res = solve4();
    for (int q = 0; q < Q; ++q) if (O[q] == 4) ans[q].first = res[q];
  }
  return ans;
}
}  // slow


int main() {
  for (; ~scanf("%d", &ID); ) {
    scanf("%d", &ALen);
    A.resize(ALen);
    for (int i = 0; i < ALen; ++i) scanf("%d", &A[i]);
    scanf("%d", &BLen);
    B.resize(BLen);
    for (int i = 0; i < BLen; ++i) scanf("%d", &B[i]);
    scanf("%d", &Q);
    O.assign(Q, -1);
    Y.assign(Q, -1);
    Z.assign(Q, -1);
    Y2.assign(Q, -1);
    Z2.assign(Q, -1);
    for (int q = 0; q < Q; ++q) {
      scanf("%d%d%d", &O[q], &Y[q], &Z[q]);
      switch (O[q]) {
        case 1: {
          --Y[q];
        } break;
        case 2: {
          --Y[q];
        } break;
        case 3: {
          --Y[q];
          --Z[q];
        } break;
        case 4: {
          scanf("%d%d", &Y2[q], &Z2[q]);
          --Y[q];
          --Y2[q];
        } break;
        default: assert(false);
      }
    }
    
    auto revB = B;
    reverse(revB.begin(), revB.end());
    saB = SuffixArray(B, true);
    saRevB = SuffixArray(revB, true);
    
    const auto ans = slow::run();
    for (int q = 0; q < Q; ++q) {
      switch (O[q]) {
        case 1: case 2: {
          printf("%d %d\n", ans[q].first, ans[q].second);
        } break;
        case 3: {
          printf("%d\n", ans[q].first);
        } break;
        case 4: {
          puts(ans[q].first ? "yes" : "no");
        } break;
        default: assert(false);
      }
    }
#ifdef LOCAL
const auto brt=brute::run();
assert(brt==ans);
#endif
  }
  return 0;
}