#include <bits/stdc++.h>

const int N = 2e5 + 50;
const int M = 61;

int n, m, q, c[N], v[N];

inline int lc(int o) { return o << 1; }
inline int rc(int o) { return o << 1 | 1; }

struct node_t {
	int v[M];
	node_t() {
		memset(v, 0, sizeof v);
	}
} node[N << 2];

struct tag_t {
	int add, cyc;
	tag_t() : add(0), cyc(0) {

	}
} tag[N << 2];

void apply(node_t &o, tag_t &to, int add, int cyc) {
	static int dummy[M];
	for (int i = 1; i <= m; ++i)
		o.v[i] += add;
	for (int i = 1; i <= m; ++i) {
		int x = (i + cyc - 1) % m + 1;
		dummy[x] = o.v[i];
	}
	for (int i = 1; i <= m; ++i)
		o.v[i] = dummy[i];
	to.add += add;
	to.cyc += cyc;
}

void push_down(int o) {
	if (tag[o].add || tag[o].cyc) {
		apply(node[lc(o)], tag[lc(o)], tag[o].add, tag[o].cyc);
		apply(node[rc(o)], tag[rc(o)], tag[o].add, tag[o].cyc);
		tag[o].add = tag[o].cyc = 0;
	}
}
void push_up(int o) {
	for (int i = 1; i <= m; ++i)
		node[o].v[i] = std::max(node[lc(o)].v[i], node[rc(o)].v[i]);
}
void modify(int o, int l, int r, int ql, int qr, int add, int cyc) {
	if (ql <= l && r <= qr) {
		apply(node[o], tag[o], add, cyc);
	}
	else {
		const int mid = l + r >> 1;
		push_down(o);
		if (ql <= mid) modify(lc(o), l, mid, ql, qr, add, cyc);
		if (qr > mid) modify(rc(o), mid + 1, r, ql, qr, add, cyc);
		push_up(o);
	}
}
void build(int o, int l, int r) {
	if (l == r) {
		node[o].v[c[l]] = v[l];
		//printf("node[%d].v[%d] = %d\n", o, c[l], node[o].v[c[l]]);
	}
	else {
		const int mid = l + r >> 1;
		build(lc(o), l, mid);
		build(rc(o), mid + 1, r);
		push_up(o);
		//for (int i = 1; i <= m; ++i)
		//	if (node[o].v[i])
		//		printf("node[%d].v[%d] = %d\n", o, i, node[o].v[i]);
	}
}
int ansv[M];
void query(int o, int l, int r, int ql, int qr) {
	if (ql <= l && r <= qr) {
		for (int i = 1; i <= m; ++i)
			ansv[i] = std::max(ansv[i], node[o].v[i]);
	}
	else {
		const int mid = l + r >> 1;
		push_down(o);
		if (ql <= mid) query(lc(o), l, mid, ql, qr);
		if (qr > mid) query(rc(o), mid + 1, r, ql, qr);
	}
}
long long dp[M];
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cout.tie(nullptr);
	std::cin >> n >> m;
	for (int i = 1; i <= n; ++i)
		std::cin >> c[i];
	for (int i = 1; i <= n; ++i)
		std::cin >> v[i];
	build(1, 1, n);
	std::cin >> q;
	while (q--) {
		int op, l, r, d;
		std::cin >> op >> l >> r;
		if (op == 1) {
			std::cin >> d;
			modify(1, 1, n, l, r, 0, d);
		}
		else if (op == 2) {
			std::cin >> d;
			modify(1, 1, n, l, r, d, 0);
		}
		else {
			memset(ansv, 0, sizeof ansv);
			query(1, 1, n, l, r);
			memset(dp, 0, sizeof dp);
			for (int i = 1; i <= m; ++i)
				if (ansv[i]) {
					for (int j = i; j <= m; ++j)
						dp[j] = std::max(dp[j], dp[j - i] + ansv[i]);
				}
			long long sum = 0, xsum = 0;
			for (int i = 1; i <= m; ++i) {
				sum += dp[i];
				xsum ^= dp[i];
			}
			std::cout << sum << " " << xsum << '\n';
		//	for (int i = 1; i <= m; ++i)
		//		if (ansv[i])
		//			printf("ansv[%d] = %d\n", i, ansv[i]);
		}
	}
	return 0;
}