#include <bits/stdc++.h>
using namespace std;
template <typename TP>
inline bool rd(TP& r) {
  r = 0;
  char tmp = getchar();
  while (tmp < '0' || tmp > '9') {
    if (tmp == EOF) return 0;
    tmp = getchar();
  }
  while ('0' <= tmp && tmp <= '9') {
    r = (r << 3) + (r << 1) + tmp - '0';
    tmp = getchar();
  }
  return 1;
}
long long ab(long long num) {
  if (num >= 0) return num;
  return -num;
}
int n, m, q;
long long a[100100], b[100100];
long long suma;
long long g[100100];
int main() {
  rd(n), rd(m), rd(q);
  for (int i = 1; i <= n; i++) {
    scanf("%I64d\n", &a[i]);
    if (i & 1)
      suma += a[i];
    else
      suma -= a[i];
  }
  for (int i = 1; i <= m; i++) scanf("%I64d\n", &b[i]);
  for (int i = 1; i <= n; i++)
    if (i & 1)
      g[0] += b[i];
    else
      g[0] -= b[i];
  for (int j = 1; j <= m - n; j++) {
    g[j] = -(g[j - 1] - b[j]);
    if (n & 1)
      g[j] += b[n + j];
    else
      g[j] -= b[n + j];
  }
  sort(g, g + m - n + 1);
  int l, r, po;
  long long ans = 0;
  po = lower_bound(g, g + m - n + 1, suma) - g;
  ans = 1000000000000000000;
  if (po >= 0 && g[po] == suma) ans = 0;
  if (po != 0) {
    po--;
    ans = min(ans, ab(suma - g[po]));
  }
  po = upper_bound(g, g + m - n + 1, suma) - g;
  if (po <= m - n) ans = min(ans, ab(suma - g[po]));
  printf("%I64d\n", ans);
  long long x;
  for (int i = 1; i <= q; i++) {
    rd(l), rd(r);
    scanf("%I64d\n", &x);
    if ((r - l + 1) & 1) {
      if (r & 1)
        suma += x;
      else
        suma -= x;
    }
    po = lower_bound(g, g + m - n + 1, suma) - g;
    ans = 1000000000000000000;
    if (po >= 0 && g[po] == suma) ans = 0;
    if (po != 0) {
      po--;
      ans = min(ans, ab(suma - g[po]));
    }
    po = upper_bound(g, g + m - n + 1, suma) - g;
    if (po <= m - n) ans = min(ans, ab(suma - g[po]));
    printf("%I64d\n", ans);
  }
  return 0;
}
