#include <bits/stdc++.h>
using namespace std;
const int inf = ~0u >> 1, MOD = 1e9 + 7;
inline int rd() {
  int first = 0, c = 0, f = 1;
  for (; c < '0' || c > '9'; c = getchar()) f = c != '-';
  for (; c >= '0' && c <= '9'; c = getchar()) first = first * 10 + c - '0';
  return f ? first : -first;
}
const int N = 1e5 + 11;
int n, m, q;
int a[N], b[N];
long long s[N], t[N], c[N];
int sz;
long long query(long long now) {
  long long *f = lower_bound(c + 1, c + sz + 1, now);
  if (f == c + sz + 1)
    f--;
  else if (f == c)
    f++;
  return f == c + 1 ? abs(*f - now) : min(abs(*f - now), abs(*(f - 1) - now));
}
int main() {
  n = rd(), m = rd(), q = rd();
  for (int i = (1), i_end = (n); i <= i_end; i++) {
    a[i] = rd();
    s[i] = s[i - 1] + ((i) % 2 ? a[i] : -a[i]);
  }
  for (int i = (1), i_end = (m); i <= i_end; i++) {
    b[i] = rd();
    t[i] = t[i - 1] + ((i) % 2 ? b[i] : -b[i]);
  }
  sz = m - n + 1;
  long long now = LONG_LONG_MAX;
  for (int i = (0), i_end = (m - n); i <= i_end; i++) {
    c[i + 1] = s[n] + (i % 2 ? t[i + n] - t[i] : t[i] - t[i + n]);
    now = min(now, abs(c[i + 1]));
  }
  cout << now << endl;
  sort(c + 1, c + sz + 1);
  long long tot = 0;
  while (q--) {
    int l = rd(), r = rd(), first = rd();
    if (r - l & 1)
      printf("%lld\n", now);
    else {
      if (l & 1)
        tot += first;
      else
        tot -= first;
      printf("%lld\n", now = query(-tot));
    }
  }
}
