#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i ++)
#define per(i, r, l) for(int i = (r); i >= (l); i --)
#define trv(i, u, v) for(int i = head[u], v = e[i].to; i; v = e[i = e[i].nxt].to)
#define fi first
#define se second
#define all(s) s.begin(), s.end()
#define sz(s) (int)(s.size())
#define lb(s) ((s) & -(s))
#define pb push_back
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
mt19937_64 hua(time(0));
template<typename T> inline bool chkmx(T &x, T y) {return x < y ? x = y, 1 : 0;}
template<typename T> inline bool chkmn(T &x, T y) {return y < x ? x = y, 1 : 0;}
template<int T> using A = array<int, T>;

inline int read() {
	int x = 0, f = 1; char c = getchar();
	for(; !isdigit(c); c = getchar()) if(c == '-')  f = 0;
	for(; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	return f ? x : -x;
}
const int maxm = 70;
const int maxn = 2e5;
const ll inf = 1e18;
int n, m, q, c[maxn + 5], v[maxn + 5];
struct Tag {
	ll d, c;
	friend Tag operator + (Tag x, Tag y) {
		return (Tag){x.d + y.d, (x.c + y.c) % m};
	}
};
struct Node {
	ll mx[maxm + 5];
	friend Node operator + (Node x, Node y) {
		Node z;
		rep(i, 1, m) { 
			z.mx[i] = max(x.mx[i], y.mx[i]);
		}
		return z;
	}
	friend Node operator + (Node x, Tag y) {
		Node z;
		rep(i, 1, m) {
			z.mx[i + y.c > m ? i + y.c - m : i + y.c] = x.mx[i] + y.d;
		}
		return z;
	}
};

struct Segment{
	#define ls u << 1
	#define rs u << 1 | 1
	#define mid (l + r >> 1)
	Node a[maxn + 5 << 2];
	Tag tag[maxn + 5 << 2];
	void seta(int u, Tag k) {a[u] = a[u] + k, tag[u] = tag[u] + k;}
	void pushdown(int u) {
		if(tag[u].c || tag[u].d) {
			seta(ls, tag[u]), seta(rs, tag[u]);
			tag[u] = {0, 0};
		}
	}
	void build(int u, int l, int r) {
		if(l == r) {
			rep(i, 1, m) a[u].mx[i] = -inf;
			a[u].mx[c[l]] = v[l];
			return ;
		}
		build(ls, l, mid), build(rs, mid + 1, r);
		a[u] = a[ls] + a[rs]; 
	}
	void upd(int u, int l, int r, int ql, int qr, Tag x) {
		if(l >= ql && r <= qr) return seta(u, x);
		pushdown(u);
		if(qr <= mid) upd(ls, l, mid, ql, qr, x);
		else if(ql > mid) upd(rs, mid + 1, r, ql, qr, x);
		else upd(ls, l, mid, ql, qr, x), upd(rs, mid + 1, r, ql, qr, x);
		a[u] = a[ls] + a[rs];
	}
	Node qry(int u, int l, int r, int ql, int qr) {
		if(l >= ql && r <= qr) return a[u];
		pushdown(u);
		if(qr <= mid) return qry(ls, l, mid, ql, qr);
		else if(ql > mid) return qry(rs, mid + 1, r, ql, qr);
		else return qry(ls, l, mid, ql, q) + qry(rs, mid + 1, r, ql, qr);
	}
}ds;
ll f[maxm + 5]; 
int main() {
//	freopen("in.txt", "r", stdin);
	n = read(), m = read();
	rep(i, 1, n) c[i] = read();
	rep(i, 1, n) v[i] = read();
	ds.build(1, 1, n);
	q = read();
	rep(i, 1, q) {
		int opt = read(), l = read(), r = read();
		if(opt == 1) {
			int d = read();
			ds.upd(1, 1, n, l, r, {0, d});
		}
		else if(opt == 2) {
			int d = read();
			ds.upd(1, 1, n, l, r, {d, 0});
		}
		else if(opt == 3) {
			Node x = ds.qry(1, 1, n, l, r);
//			rep(i, 1, m) cout << x.mx[i] << " \n"[i == m];
			rep(i, 0, m) f[i] = 0;
			rep(i, 1, m) {
				rep(j, 0, m - i) {
					chkmx(f[i + j], f[j] + x.mx[i]);
				}
			}
			ll sum = 0, xr = 0;
			rep(i, 1, m) sum += f[i], xr ^= f[i];
			cout << sum << ' ' << xr << '\n';
		}
	}
	return 0;
}