#include <bits/stdc++.h>

using namespace std;

#define fr(i, x, y) for (int i = (x), _ed = (y); i <= _ed; i++) 
#define rp(i, x, y) for (int i = (x), _ed = (y); i >= _ed; i--) 

const int maxn = 2e5 + 40;

int n, m;
int c[maxn], v[maxn];

#define ls rt << 1
#define rs rt << 1 | 1

#define int long long
int maxx[maxn << 2][61];

int tag1[maxn << 2], tag2[maxn << 2];
int tmp[62];
void pushup(int rt) { for (int i = 1; i <= m; i++) maxx[rt][i] = max(maxx[ls][i], maxx[rs][i]); }
void push1(int rt, int v) {
	for (int i = 1; i <= m; i++) {
		int k = (i + v) %m; if (k == 0) k = m;
		tmp[k] = maxx[rt][i];
	}
	for (int i = 1; i <= m; i++) maxx[rt][i] = tmp[i];
	(tag1[rt] += v) %= m;
}

void push2(int rt, int v) {
	for (int i = 1; i <= m; i++) maxx[rt][i] += v;
	tag2[rt] += v;
}

void build(int rt, int l, int r) {
	if (l == r) {
		maxx[rt][c[l]] = v[l];
		return;
	}
	int mid = (l + r) / 2;
	build(ls, l, mid);
	build(rs, mid + 1, r);
	pushup(rt);
}
void pushdown(int rt) {
	if (tag1[rt]) push1(ls, tag1[rt]), push1(rs, tag1[rt]);
	if (tag2[rt]) push2(ls, tag2[rt]), push2(rs, tag2[rt]);
	tag1[rt] = tag2[rt] = 0;
}
void update(int rt, int l, int r, int L, int R, int v) {
	if (L <= l && r <= R) {
		push1(rt, v);
		return;
	}
	int mid = (l + r) / 2;
	pushdown(rt);
	if (L <= mid) update(ls, l, mid, L, R, v);
	if (R > mid) update(rs, mid + 1, r, L, R, v);
	pushup(rt);
}
void update2(int rt, int l, int r, int L, int R, int v) {
	if (L <= l && r <= R) {
		push2(rt, v);
		return;
	}
	int mid = (l + r) / 2;
	pushdown(rt);
	if (L <= mid) update2(ls, l, mid, L, R, v);
	if (R > mid) update2(rs, mid + 1, r, L, R, v);
	pushup(rt);
}
int ans[maxn];
void query(int rt, int l, int r, int L, int R) {
	if (L <= l && r <= R) {
		for (int i = 1; i <= m; i++) ans[i] = max(ans[i], maxx[rt][i]);
		return ;
	}
	int mid = (l + r) / 2;
	pushdown(rt);
	if (L <= mid) query(ls, l, mid, L, R);
	if (R > mid) query(rs, mid + 1, r, L, R);
	pushup(rt);
}


inline int ri() {
	int x; scanf("%lld", &x); return x;
}
int anss[maxn];
signed main() {
	n = ri(), m = ri();
	for (int i = 1; i <= n; i++) c[i] = ri();
	for (int i = 1; i <= n; i++) v[i] = ri();
	build(1, 1, n);
	int q; q = ri();
	while (q--) {
		int opt = ri(), l = ri(), r = ri();
		if (opt == 1) {
			int d = ri(); update(1, 1, n, l, r, d);
		}
		if (opt == 2) {
			int d = ri(); update2(1, 1, n, l, r, d);
		}
		if (opt == 3) {
			for (int i = 1; i <= m; i++) ans[i] = 0, anss[i] = 0;
			query(1, 1, n, l, r);
			int res = 0, ress = 0;
			for (int i = 1; i <= m; i++) {
				for (int j = i; j <= m; j++) {
					anss[j] = max(anss[j], anss[j - i] + ans[i]);
				}
			}
			for (int i = 1; i <= m; i++) res = res + anss[i], ress = ress ^ anss[i];
			printf("%lld %lld\n", res, ress);
		}
	}
	return 0;
}