#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using pii = pair<int, int>;
int a[100010], b[100010];
ll c[100010];
vector<ll> v;
ll query(ll s) {
  auto it = upper_bound(v.begin(), v.end(), s);
  auto prevIt = it;
  --prevIt;
  if (it == v.end()) return abs(s - (*prevIt));
  if (it == v.begin()) return abs(s - (*it));
  return min(abs(s - (*prevIt)), abs(s - (*it)));
}
int main() {
  int i, j, n, m, q, l, r, x;
  ll sa;
  cin >> n >> m >> q;
  for (i = 1; i <= n; ++i) cin >> a[i];
  for (j = 1; j <= m; ++j) cin >> b[j];
  for (sa = 0, i = 1; i <= n; ++i) sa += (i % 2 == 1 ? a[i] : -a[i]);
  for (j = 1; j <= n; ++j) c[1] += (j % 2 == 1 ? b[j] : -b[j]);
  for (i = 2; i <= m - n + 1; ++i)
    c[i] = -(c[i - 1] - b[i - 1]) + (n % 2 == 1 ? b[i + n - 1] : -b[i + n - 1]);
  for (i = 1; i <= m - n + 1; ++i) v.push_back(c[i]);
  sort(v.begin(), v.end());
  cout << query(sa) << '\n';
  while (q--) {
    cin >> l >> r >> x;
    if (l % 2 == r % 2) {
      if (l % 2 == 0)
        sa -= x;
      else
        sa += x;
    }
    cout << query(sa) << '\n';
  }
  return 0;
}
