#include <bits/stdc++.h>
const int MaxN = 2e5;
using namespace std;
int n, m, Q, tot;
long long sum_1, sum_2;
long long a[MaxN + 5], b[MaxN + 5], t[MaxN + 5];
long long A[MaxN + 5], B[MaxN + 5];
void Init() {
  sum_1 = sum_2 = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
    if (i & 1)
      sum_1 = sum_1 + a[i];
    else
      sum_2 = sum_2 + a[i];
  }
  for (int i = 1; i <= m; i++) {
    scanf("%lld", &b[i]);
    A[i] = A[i - 1] + ((i & 1) ? b[i] : 0);
    B[i] = B[i - 1] + ((i & 1) ? 0 : b[i]);
  }
  for (int i = 1; i <= m - n + 1; i++) {
    long long tot_2 = B[i + n - 1] - B[i - 1];
    long long tot_1 = A[i + n - 1] - A[i - 1];
    if (i & 1)
      t[i] = tot_2 - tot_1;
    else
      t[i] = tot_1 - tot_2;
  }
  tot = m - n + 1;
  sort(t + 1, t + tot + 1);
}
long long Query(long long tmp) {
  int l = 0, r = tot + 1;
  while (l < r - 1) {
    int mid = (l + r) >> 1;
    if (tmp + t[mid] <= 0)
      l = mid;
    else
      r = mid;
  }
  long long res = 1LL << 60;
  for (int i = max(1, r - 5); i <= min(tot, r + 5); i++) {
    res = min(res, abs(tmp + t[i]));
  }
  return res;
}
void Solve() {
  long long res = sum_1 - sum_2;
  printf("%lld\n", Query(res));
  for (int i = 1; i <= Q; i++) {
    int l, r;
    long long x;
    scanf("%d%d%lld", &l, &r, &x);
    if (((l & 1) ^ (r & 1)) == 0) {
      if (l & 1)
        res += x;
      else
        res -= x;
    }
    printf("%lld\n", Query(res));
  }
}
int main() {
  while (~scanf("%d%d%d", &n, &m, &Q)) {
    Init();
    Solve();
  }
  return 0;
}
