#include<bits/stdc++.h>
using std::cin, std::cout;
namespace rgs = std::ranges;
using ll = long long;
using u64 = unsigned long long;
using db = double;

const int N = 2e6 + 10;
namespace candy {
	int nn;
	struct info {
		ll le, ri;
		bool good() const {
			return le <= ri;
		}
		ll eval(ll v) const {
			return std::min(ri, std::max(v, le));
		}
	};

	info operator + (const info & x, const info & y) {
		return {std::max(x.le, y.le), std::min(x.ri, y.ri)};
	}

	info sgt[N << 2];
	void upt(int pos, info v, int cur = 1, int l = 1, int r = nn) {
		if(l == r) {
			sgt[cur] = v;
			return ;
		}
		int mid = (l + r) >> 1;
		if(pos <= mid) {
			upt(pos, v, cur << 1, l, mid);
		} else {
			upt(pos, v, cur << 1 | 1, mid + 1, r);
		}
		sgt[cur] = sgt[cur << 1] + sgt[cur << 1 | 1];
	}
	int qry(int v, info t, int cur = 1, int l = 1, int r = nn) {
		if(l == r) {
			return t.eval(sgt[cur].eval(v));
		}
		int mid = (l + r) >> 1;
		info tt = sgt[cur << 1 | 1] + t;
		if(tt.good()) {
			return qry(v, tt, cur << 1, l, mid);
		} else {
			return qry(v, t, cur << 1 | 1, mid + 1, r);
		}
	}


}
int n, m, q;
int a[N], b[N];
main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n >> m >> q;
	candy::nn = n;
	for(int i = 1;i <= n;++i) {
		cin >> a[i];
	}
	for(int i = 1;i <= m;++i) {
		cin >> b[i];
	}
	int x = m;
	for(;x < n;x += m) {
		for(int i = 1;i <= m;++i) b[x + i] = b[i];
	}
	m = x;
	auto get = [&](int a, int b) {
		return candy::info{std::min(a, b), std::max(a, b)};
	};
	for(int i = 1;i <= n;++i) {
		candy::upt(i, get(a[i], b[m - n + i]));
	}
	using pr = std::pair<int, int>;
	std::vector<int> bb(b + 1, b + m + 1);
	rgs::sort(bb); bb.erase(unique(bb.begin(), bb.end()), bb.end());
	std::vector<int> anc(bb.size() + 1), MAX(bb.size(), -1);
	for(int i = 0;i < (int) anc.size();++i) {
		anc[i] = i;
	}
	auto find = [&](auto f, int x) -> int {
		return anc[x] == x ? x : anc[x] = f(f, anc[x]);
	};

	std::vector<pr> pre, suf;
	for(int i = m;i >= 1;--i) {
		int A = b[i], B = b[(i - n - 1 + m + m) % m + 1];
		if(A > B) {
			std::swap(A, B);
		}
		A = lower_bound(bb.begin(), bb.end(), A) - bb.begin();
		B = lower_bound(bb.begin(), bb.end(), B) - bb.begin();
		for(;(A = find(find, A)) < B;anc[A] = A + 1) {
			MAX[A] = i;
		}
	}

	int lastans = 0;
	for(int i = 1, x, y, x0;i <= q;++i) {
		cin >> x >> y >> x0;
		x += 1;
		a[x] = y ^ lastans;
		candy::upt(x, get(a[x], b[m - n + x]));

		auto s = candy::sgt[1];
		x0 ^= lastans;
		if(s.good()) {
			int l = s.le - 1, r = s.ri;
			for(;l + 1 < r;) {
				int mid = (l + r) >> 1;
				int maxid = -1;
				auto i0 = upper_bound(bb.begin(), bb.end(), mid);
				if(i0 != bb.begin()) maxid = MAX[i0 - bb.begin() - 1];
				int leq = 0;
				if(maxid == -1) {
					leq = x0 <= mid;
				} else {
					ll posi = (ll) n * m - m + maxid - 1 - n;
					int sa = a[posi % n + 1] <= mid, sb = b[posi % m + 1] <= mid;
					assert(sa == sb);
					leq = sa;
				}
				if(leq) {
					r = mid;
				} else {
					l = mid;
				}
			}
			lastans = r;
		} else {
			lastans = candy::qry(x0, {0, 1ll<<31});
		}
		cout << lastans << '\n';
	}

}