#include<bits/stdc++.h>
#define fo(i, x, y) for(int i = x, _b = y; i <= _b; i ++)
#define ff(i, x, y) for(int i = x, _b = y; i <  _b; i ++)
#define fd(i, x, y) for(int i = x, _b = y; i >= _b; i --)
#define ll long long
#define pp printf
#define hh pp("\n")
using namespace std;

const int N = 2e3 + 5;

#define ui unsigned int

int n; ll m;
ui a[N], b[N];

const ui inf = 4294967295ll;

void qmo(ui *a) {
	fd(i, 2 * n, n + 1) if(a[i]) {
		fo(j, 1, n) a[i - j] ^= b[j] & a[i];
		a[i] = 0;
	}
}
ui c[N];
void mul(ui *a, ui *b) {
	fo(i, 0, 2 * n) c[i] = 0;
	fo(i, 0, n) fo(j, 0, n) c[i + j] ^= a[i] & b[j];
	qmo(c);
	fo(i, 0, n) a[i] = c[i];
}

ui s[N], x[N];

int main() {
	scanf("%d", &n);
	fo(i, 1, n) scanf("%u", &a[i]);
	fo(i, 1, n) scanf("%u", &b[i]);
	scanf("%lld", &m);
	s[0] = inf; x[1] = inf;
	for(; m; m /= 2, mul(x, x))
		if(m & 1) mul(s, x);
	ui ans = 0;
	fo(i, 1, n) ans ^= s[i] & a[i];
	pp("%u\n", ans);
}
/*
test only
-----------------------------------
©著作权归作者所有：来自51CTO博客作者Cold_Chair的原创作品，请联系作者获取转载授权，否则将追究法律责任
【JSOI2017】 预言（广义常系数齐次线性递推）
https://blog.51cto.com/u_16105286/6259948
*/