#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;

int N, M, Q;
int l, r;
long long v, a[500005], b[500005];

void update(int l, int r, long long cur){
	for (int i = l; i <= r; i ++){
		a[i] += cur;
	}
}

long long solve(){
	long long res = 0;
	for (int k = 0; k <= M - N; k ++){
		long long tmp = 0, pow = 0;
		for (int i = 1; i <= N; i ++){
			pow = ((i & 1) ? 1 : -1);
			tmp += pow * (a[i] - b[i + k]);
		}
		if (!k) res = abs(tmp);
		res = min(res, abs(tmp));
	}
	return res;
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("data.in", "r", stdin);
	freopen("data.out", "w", stdout);
#endif

	scanf("%d %d %d", &N, &M, &Q);
	for (int i = 1; i <= N; i ++){
		scanf("%lld", &a[i]);
	}
	for (int i = 1; i <= M; i ++){
		scanf("%lld", &b[i]);
	}
	printf("%lld\n", solve());
	while (Q --){
		scanf("%d %d %lld", &l, &r, &v);
		if (l > r) swap(l, r);
		update(l, r, v);
		printf("%lld\n", solve());
	}

	return 0;
}