#include <bits/stdc++.h>
using namespace std;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, m, q;
  cin >> n >> m >> q;
  vector<long long> a(n + 1), b(m + 1), c(m + 1), v;
  long long cur = 0;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
    if (i & 1)
      cur += a[i];
    else
      cur -= a[i];
  }
  long long d = 0;
  for (long long i = 1; i <= m; i++) {
    cin >> b[i];
    if (i & 1)
      c[i] = c[i - 1] + b[i];
    else
      c[i] = c[i - 1] - b[i];
  }
  for (long long i = 1; i + n - 1 <= m; i++) {
    if (i & 1)
      v.push_back(c[i + n - 1] - c[i - 1]);
    else
      v.push_back(c[i - 1] - c[i + n - 1]);
  }
  v.push_back(-1e18);
  v.push_back(1e18);
  sort(v.begin(), v.end());
  auto solve = [&](long long x) {
    long long k = lower_bound(v.begin(), v.end(), x) - v.begin();
    return min(v[k] - x, x - v[k - 1]);
  };
  cout << solve(cur) << endl;
  while (q--) {
    long long l, r, x;
    cin >> l >> r >> x;
    if ((r - l + 1) & 1) {
      if (l & 1)
        cur += x;
      else
        cur -= x;
    }
    cout << solve(cur) << "\n";
  }
}
