#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
#define fr(i,a,b) for(int i=a;i<=b;i++)
#define ll long long
#define mod 998244353
#define N 100005
#define M 17
#define inf 0x3f3f3f3f
int n,m,Q,w[M],c[N],d[N];
ll lastans;

//DS
multiset<int> A[M][1<<M];
struct SGT1{
	struct SGT{
		int ans,mxa,mxb;
	}t[1<<(M+1)];
	int Max(int a,int b){
		return a<b?b:a;
	}
	void pushup(int nd){
		t[nd].mxa=Max(t[nd<<1].mxa,t[nd<<1|1].mxa);
		t[nd].mxb=Max(t[nd<<1].mxb,t[nd<<1|1].mxb);
		t[nd].ans=Max(Max(t[nd<<1].ans,t[nd<<1|1].ans),t[nd<<1].mxb+t[nd<<1|1].mxa);
	}
	void build(int nd,int l,int r){
		if(l==r){
			t[nd].mxa=t[nd].mxb=t[nd].ans=-inf;
			return;
		}
		else{
			int mid=(l+r)>>1;
			build(nd<<1,l,mid);
			build(nd<<1|1,mid+1,r);
		}
	}
	void updatea(int nd,int l,int r,int x,int aa){
		if(l==r){
			t[nd].mxa=aa;
			return;
		}
		else{
			int mid=(l+r)>>1;
			if(x<=mid)updatea(nd<<1,l,mid,x,aa);
			else  updatea(nd<<1|1,mid+1,r,x,aa);
			pushup(nd);
		}
	}
	void updateb(int nd,int l,int r,int x,int bb){
		if(l==r){
			t[nd].mxb=bb;
			return;
		}
		else{
			int mid=(l+r)>>1;
			if(x<=mid)updateb(nd<<1,l,mid,x,bb);
			else  updateb(nd<<1|1,mid+1,r,x,bb);
			pushup(nd);
		}
	}
	int findmx(){
		return t[1].ans;
	}
}T[M];

void add(int k,int a,int b,int op){
	if(op==1)A[k][a].insert(b);
	else A[k][a].erase(A[k][a].find(b));
	if(A[k][a].size()){
		T[k].updatea(1,1,(1<<k),a+1,*A[k][a].rbegin());
		T[k].updateb(1,1,(1<<k),(1<<k)-a,*A[k][a].rbegin());
	}
	else{
		T[k].updatea(1,1,(1<<k),a+1,-inf);
		T[k].updateb(1,1,(1<<k),(1<<k)-a,-inf);
	}
}
void ins(int a,int b,int op){
	fr(i,1,m){
		int ag=a&((1<<i)-1);
		add(i,ag,b,op);
	}
}
ll Query(){
	ll res=0;
	fr(i,1,m)res=max(res,1ll*T[i].findmx()*w[i]);
	return res;
}

int readi(){
	int s=0;
	char c=getchar();
	while(c<'0'||c>'9')c=getchar();
	while(c>='0'&&c<='9')s=s*10+c-'0',c=getchar();
	return s;
}
ll readl(){
	ll s=0;
	char c=getchar();
	while(c<'0'||c>'9')c=getchar();
	while(c>='0'&&c<='9')s=s*10+c-'0',c=getchar();
	return s;
}
int main(){
	n=readi(),m=readi(),Q=readi();
	fr(i,1,m)T[i].build(1,1,(1<<i));
	fr(i,1,m)w[i]=readi();
	fr(i,1,n)c[i]=readi();
	fr(i,1,n)d[i]=readi();
	fr(i,1,n)ins(c[i],d[i],1);
	printf("%lld\n",lastans=Query());
	while(Q--){
		ll x=readl()^lastans,u=readl()^lastans,v=readl()^lastans;
		if(x<1||x>n||u>=(1ll<<m)||v>=(1ll<<m)){
			puts("WA");return 0;
		}
		ins(c[x],d[x],-1);
		ins(c[x]=u,d[x]=v,1);
		printf("%lld\n",lastans=Query());
	}
	return 0;
}