#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 1000000009;
const ll mxr = 1e6 + 10;
const ll oo = 33720360000000000;
const ll si = 200005;
vector<ll> pos;
ll sz;
void bsearch(ll x) {
  ll l = 0, r = sz - 1, ans = 1000000000000000000;
  while (l <= r) {
    ll mid = l + (r - l) / 2;
    if (pos[mid] + x > 0) {
      r = mid - 1;
      ans = min(ans, pos[mid] + x);
    } else if (pos[mid] + x < 0) {
      l = mid + 1;
      ans = min(ans, -(pos[mid] + x));
    } else {
      ans = 0;
      break;
    }
  }
  cout << ans << "\n";
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll n, m, q;
  cin >> n >> m >> q;
  ll b[m], pr[m], tot = 0;
  for (int i = 0; i < n; i++) {
    ll x;
    cin >> x;
    i % 2 ? tot -= x : tot += x;
  }
  for (int i = 0; i < m; i++) cin >> b[i];
  pr[0] = -b[0];
  for (int i = 1; i < m; i++) {
    pr[i] = pr[i - 1];
    i % 2 ? pr[i] += b[i] : pr[i] -= b[i];
  }
  pos.push_back(pr[n - 1]);
  for (int i = n; i < m; i++) {
    ll con = pr[i] - pr[i - n];
    (i - n + 1) % 2 ? pos.push_back(-con) : pos.push_back(con);
  }
  sort(pos.begin(), pos.end());
  sz = pos.size();
  bsearch(tot);
  while (q--) {
    ll l, r, x, us;
    cin >> l >> r >> x;
    l -= 1;
    r -= 1;
    us = r - l + 1;
    if (us % 2) {
      if (l % 2)
        tot -= x;
      else
        tot += x;
    }
    bsearch(tot);
  }
  return 0;
}
