#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &x : v) is >> x;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < v.size(); ++i) {
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  }
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << '(' << p.first << ',' << p.second << ')';
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &m) {
  os << '{';
  for (auto itr = m.begin(); itr != m.end(); ++itr) {
    os << '(' << itr->first << ',' << itr->second << ')';
    if (++itr != m.end()) os << ',';
    --itr;
  }
  os << '}';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &s) {
  os << '{';
  for (auto itr = s.begin(); itr != s.end(); ++itr) {
    os << *itr;
    if (++itr != s.end()) os << ',';
    --itr;
  }
  os << '}';
  return os;
}
void debug_out() { cerr << '\n'; }
template <class Head, class... Tail>
void debug_out(Head &&head, Tail &&...tail) {
  cerr << head;
  if (sizeof...(Tail) > 0) cerr << ", ";
  debug_out(move(tail)...);
}
template <typename T>
T gcd(T x, T y) {
  return y != 0 ? gcd(y, x % y) : x;
}
template <typename T>
T lcm(T x, T y) {
  return x / gcd(x, y) * y;
}
template <class T1, class T2>
inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2>
inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename Monoid, typename OperatorMonoid>
struct LazySegmentTree {
  typedef function<Monoid(Monoid, Monoid)> F;
  typedef function<Monoid(Monoid, OperatorMonoid)> G;
  typedef function<OperatorMonoid(OperatorMonoid, OperatorMonoid)> H;
  int n, hi;
  F f;
  G g;
  H h;
  Monoid id0;
  OperatorMonoid id1;
  vector<Monoid> dat;
  vector<OperatorMonoid> laz;
  LazySegmentTree(int n_, F f, G g, H h, Monoid id0, OperatorMonoid id1)
      : f(f), g(g), h(h), id0(id0), id1(id1) {
    init(n_);
  }
  void init(int n_) {
    n = 1, hi = 0;
    while (n < n_) n <<= 1, ++hi;
    dat.assign(n << 1, id0);
    laz.assign(n << 1, id1);
  }
  void build(const vector<Monoid> &v) {
    for (int i = 0; i < v.size(); ++i) dat[i + n] = v[i];
    for (int i = n - 1; i; --i) dat[i] = f(dat[i << 1 | 0], dat[i << 1 | 1]);
  }
  inline Monoid reflect(int k) {
    return laz[k] == id1 ? dat[k] : g(dat[k], laz[k]);
  }
  inline void propagate(int k) {
    if (laz[k] == id1) return;
    laz[k << 1 | 0] = h(laz[k << 1 | 0], laz[k]);
    laz[k << 1 | 1] = h(laz[k << 1 | 1], laz[k]);
    dat[k] = reflect(k);
    laz[k] = id1;
  }
  inline void thrust(int k) {
    for (int i = hi; i; --i) propagate(k >> i);
  }
  inline void recalc(int k) {
    while (k >>= 1) dat[k] = f(reflect(k << 1 | 0), reflect(k << 1 | 1));
  }
  void update(int a, int b, OperatorMonoid x) {
    if (a >= b) return;
    thrust(a += n), thrust(b += n - 1);
    for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
      if (l & 1) laz[l] = h(laz[l], x), ++l;
      if (r & 1) --r, laz[r] = h(laz[r], x);
    }
    recalc(a), recalc(b);
  }
  void set_val(int k, Monoid x) {
    thrust(k += n);
    dat[k] = x, laz[k] = id1;
    recalc(k);
  }
  Monoid query(int a, int b) {
    if (a >= b) return id0;
    thrust(a += n), thrust(b += n - 1);
    Monoid vl = id0, vr = id0;
    for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
      if (l & 1) vl = f(vl, reflect(l++));
      if (r & 1) vr = f(reflect(--r), vr);
    }
    return f(vl, vr);
  }
  template <typename C>
  int find_first(int a, const C &check, Monoid &M, int k, int l, int r) {
    if (l + 1 == r) {
      M = f(M, reflect(k));
      return check(M) ? k - n : -1;
    }
    propagate(k);
    int m = (l + r) >> 1;
    if (m <= a) return find_first(a, check, M, k << 1 | 1, m, r);
    if (a <= l && !check(f(M, dat[k]))) {
      M = f(M, dat[k]);
      return -1;
    }
    int vl = find_first(a, check, M, k << 1 | 0, l, m);
    if (~vl) return vl;
    return find_first(a, check, M, k << 1 | 1, m, r);
  }
  template <typename C>
  int find_first(int a, const C &check) {
    Monoid M = id0;
    return find_first(a, check, M, 1, 0, n);
  }
  template <typename C>
  int find_last(int b, const C &check, Monoid &M, int k, int l, int r) {
    if (l + 1 == r) {
      M = f(reflect(k), M);
      return check(M) ? k - n : -1;
    }
    propagate(k);
    int m = (l + r) >> 1;
    if (b <= m) return find_last(b, check, M, k << 1 | 0, l, m);
    if (r <= b && !check(f(dat[k], M))) {
      M = f(dat[k], M);
      return -1;
    }
    int vr = find_last(b, check, M, k << 1 | 1, m, r);
    if (~vr) return vr;
    return find_last(b, check, M, k << 1 | 0, l, m);
  }
  template <typename C>
  int find_last(int b, const C &check) {
    Monoid M = id0;
    return find_last(b, check, M, 1, 0, n);
  }
  Monoid operator[](int i) { return query(i, i + 1); }
};
const int MAX_A = 1e6 + 10;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  vector<int> a(n), b(m);
  cin >> a >> b;
  auto f = [](int a, int b) { return min(a, b); };
  auto g = [](int a, int b) { return a + b; };
  LazySegmentTree<int, int> seg(MAX_A, f, g, g, INF, 0);
  vector<int> v(MAX_A, 0);
  seg.build(v);
  for (int i = 0; i < n; ++i) seg.update(a[i], MAX_A, 1);
  for (int i = 0; i < m; ++i) seg.update(b[i], MAX_A, -1);
  int q;
  cin >> q;
  for (; q--;) {
    int t, i, x;
    cin >> t >> i >> x;
    --i;
    if (t == 1) {
      seg.update(a[i], MAX_A, -1);
      a[i] = x;
      seg.update(a[i], MAX_A, 1);
    } else {
      seg.update(b[i], MAX_A, 1);
      b[i] = x;
      seg.update(b[i], MAX_A, -1);
    }
    int ans = seg.find_last(MAX_A, [&](int x) { return x < n - m; });
    cout << (ans < 0 ? -1 : ans + 1) << '\n';
  }
}
