#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn = 5e5 + 5;
const long long inf = 0x7FFFFFFFFFFFFFFF;
int n, m, q;
long long sum, b[maxn], f[maxn];
int main() {
    scanf("%d%d%d", &n, &m, &q);
    for (int i = 1; i <= n; i++) {
        long long a; scanf("%lld", &a);
        sum += (i & 1) ? a : -a;
    }
    for (int i = 1; i <= m; i++) {
        scanf("%lld", b + i);
        if (i <= n) f[0] += (i & 1) ? b[i] : -b[i];
        else f[i - n] = -f[i - n - 1] + ((n & 1) ? b[i] : -b[i]) + b[i - n];
    }
    sort(f, f + m - n + 1);
    int l, r, p = lower_bound(f, f + m - n + 1, sum) - f;
    long long v, v1 = inf, v2 = inf;
    if (p > 0) v1 = sum - f[p - 1];
    if (p <= m - n) v2 = f[p] - sum;
    printf("%lld\n", min(v1, v2));
    for (int i = 1; i <= q; i++) {
        scanf("%d%d%lld", &l, &r, &v);
        if (((r - l) & 1) ^ 1) sum += (r & 1) ? v : -v;
        p = lower_bound(f, f + m - n + 1, sum) - f;
        v1 = inf, v2 = inf;
        if (p > 0) v1 = sum - f[p - 1];
        if (p <= m - n) v2 = f[p] - sum;
        printf("%lld\n", min(v1, v2));
    }
    return 0;
}