#include<bits/stdc++.h>
#define int long long
using namespace std;
void ts(){cout<<"IAKIOI\n";}
inline int read(){
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
int n,m,q;
int a[500005],b[500005];
int f[500005];
signed main(){
	n=read(),m=read(),q=read();
	for(int i=1;i<=n;i++)a[i]=read();
	for(int i=1;i<=m;i++)b[i]=read();
	int sa=0;
	for(int i=1;i<=n;i++){
		if(i&1)sa+=a[i];
		else sa-=a[i];
	}
	for(int i=1;i<=n;i++){
		if(i&1)f[0]-=b[i];
		else f[0]+=b[i];
	}
	for(int i=1;i<=m-n;i++){
		f[i]=f[i-1]+b[i];
		f[i]=-f[i];
		if(n&1)f[i]-=b[i+n];
		else f[i]+=b[i+n];
	}
	sort(f,f+m-n+1);
	int res=1ll<<60;
	for(int i=0;i<=m-n;i++)res=min(res,abs(sa+f[i]));
	cout<<res<<"\n";
	while(q--){
		int l=read(),r=read(),v=read();
		if(l>r)swap(l,r);
		int o=0;
		int ql=l,qr=r;
		if(ql%2==0)ql++;
		if(qr%2==0)qr--;
		if(ql<=qr)o=(qr-ql)/2+1;
		int e=r-l+1-o;
		sa+=(o-e)*v;
		//cout<<sa<<" ";
		//sa+f[i]<=0 最大的 f[i]
		int vv=lower_bound(f,f+m-n+1,-sa)-f;
		res=1ll<<60;
		for(int i=max(vv-5,0ll);i<=min(m-n,vv+5);i++)res=min(res,abs(sa+f[i]));
		cout<<res<<"\n";
	}
	//15 3 7
	return 0;
}
//look at my code
//my code is amazing