#include <bits/stdc++.h>
using namespace std;
template <typename _T>
inline void _DBG(const char *s, _T x) {
  cerr << s << " = " << x << "\n";
}
template <typename _T, typename... args>
void _DBG(const char *s, _T x, args... a) {
  while (*s != ',') cerr << *s++;
  cerr << " = " << x << ',';
  _DBG(s + 1, a...);
}
const int N = 2e5 + 7;
int n, m, q;
long long a[N], b[N], F[N];
set<long long> S, R;
long long ro = 0;
long long solve() {
  auto it1 = S.lower_bound(ro);
  long long ans = 1e18 + 7;
  if (it1 != S.end()) ans = min(ans, abs(*it1 - ro));
  it1 = R.lower_bound(-ro);
  if (it1 != R.end()) ans = min(ans, abs(-ro - *it1));
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> q;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= m; i++) cin >> b[i];
  for (int i = 1; i <= n; i++)
    (i & 1) ? F[0] += a[i] - b[i] : F[0] += b[i] - a[i];
  long long upd = 0, zn = 1;
  for (int i = 1; i <= n + 1; i++) {
    if (i == 1 || i == n + 1)
      upd += zn * b[i];
    else
      upd += zn * 2LL * b[i];
    zn *= (-1);
  }
  zn *= (-1);
  for (int j = 1; j <= m - n; j++) {
    F[j] = F[j - 1] + upd;
    upd -= b[j] - b[j + 1];
    if (zn == 1)
      upd += b[j + n] - b[j + n + 1];
    else
      upd += b[j + n + 1] - b[j + n];
    upd *= (-1);
  }
  for (int j = 0; j <= m - n; j++) {
    S.insert(F[j]);
    R.insert(-F[j]);
  }
  cout << solve() << "\n";
  for (int i = 0; i < q; i++) {
    int l, r;
    long long x;
    cin >> l >> r >> x;
    if (l % 2 == r % 2) {
      if (l % 2 == 1)
        ro -= x;
      else
        ro += x;
    }
    cout << solve() << "\n";
  }
  return 0;
}
