#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const ll MAXN = 1e5+10,M = 16,INF = 3e18,V = 2e9;
void tomax(ll& x,ll y){x = max(x,y);}

int n,m,q,pw[M+1];
ll w[M+1],c[MAXN],d[MAXN],lst;

struct PQ{ //可删堆
	priority_queue<ll>p,q;
	void ins(ll x){p.push(x);}
	void rmv(ll x){q.push(x);}
	int sz(){while(p.size() && q.size() && p.top()==q.top())p.pop(),q.pop();return p.size();}
	ll top(){return p.top();}	
}a[M+1][1<<M],b[M+1][1<<M];

#define mid ((l+r)>>1)
struct Seg{
	ll t[1<<(M+2)],a[1<<(M+2)],b[1<<(M+2)];
	void pu(int x){
		t[x] = max({t[lc(x)],t[rc(x)],b[lc(x)]+a[rc(x)]});
		a[x] = max(a[lc(x)],a[rc(x)]);
		b[x] = max(b[lc(x)],b[rc(x)]);
	}
	void build(int x,int l,int r){
		a[x] = b[x] = -V;
		if(l==r)return;
		build(lc(x),l,mid);build(rc(x),mid+1,r);
	}
	void mdf(int x,int l,int r,int pos,ll val,int tag){
		if(l==r){
			if(tag==1)a[x] = val;
			else if(tag==2)b[x] = val;
			else assert(0);
			t[x] = a[x]+b[x];
			return;
		}
		(pos<=mid)?(mdf(lc(x),l,mid,pos,val,tag)):(mdf(rc(x),mid+1,r,pos,val,tag));
		pu(x);
	}
}seg[M+1];
#undef mid

void mdf(ll c,ll d,ll tag){ 
	rep(x,1,m){
		ll val=c%pw[x];
		if(tag==1){
			a[x][val].ins(d);
			if(val)b[x][pw[x]-val].ins(d);
		}else{	
			a[x][val].rmv(d);
			if(val)b[x][pw[x]-val].rmv(d);
		}
		ll tmp = (a[x][val].sz()) ? (a[x][val].top()) : (-V);
		seg[x].mdf(1,0,pw[x]-1,val,tmp,1);

		if(val){
			ll tmp = (b[x][pw[x]-val].sz()) ? (b[x][pw[x]-val].top()) : (-V);
			seg[x].mdf(1,0,pw[x]-1,pw[x]-val,tmp,2);
		}
	}
}

ll calc(){
	ll ans = 0;
	rep(x,1,m){
		ll sum = seg[x].t[1];
		tomax(ans,sum * w[x]);
	}
	return ans;
}

int main(){
	ios::sync_with_stdio(false);cin.tie(0);

	cin>>n>>m>>q;
	pw[0]=1;
	rep(i,1,m)cin>>w[i],pw[i]=pw[i-1]*2;

	rep(i,1,n)cin>>c[i];
	rep(i,1,n)cin>>d[i];

	rep(i,1,m)seg[i].build(1,0,pw[i]-1);
	rep(i,1,n)mdf(c[i],d[i],1);

	lst = calc();
	cout<<lst<<"\n";

	rep(i,1,q){
		ll x,u,v; cin>>x>>u>>v;
		x ^= lst,u ^= lst,v ^= lst;

		mdf(c[x],d[x],-1);
		c[x] = u,d[x] = v;
		mdf(c[x],d[x],1);

		lst = calc();
		cout<<lst<<"\n";
	}

    return 0;
}