#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m, q;
  cin >> n >> m >> q;
  vector<int> a(n);
  for (int i = 0; i != n; ++i) cin >> a[i];
  vector<int> b(m);
  for (int i = 0; i != m; ++i) cin >> b[i];
  long long sum = 0;
  for (int i = 0; i != n; ++i) {
    if (i & 1)
      sum -= a[i];
    else
      sum += a[i];
  }
  vector<long long> sums;
  long long curr = 0;
  for (int i = 0; i != n; ++i) {
    if (i & 1)
      curr -= b[i];
    else
      curr += b[i];
  }
  sums.push_back(curr);
  for (int i = n; i != m; ++i) {
    curr -= b[i - n];
    curr *= -1;
    if (n & 1)
      curr += b[i];
    else
      curr -= b[i];
    sums.push_back(curr);
  }
  sort(sums.begin(), sums.end());
  int L = 0;
  int R = m - n + 1;
  while (R - L != 1) {
    if (sums[L + R >> 1] <= sum)
      L = L + R >> 1;
    else
      R = L + R >> 1;
  }
  if (R <= m - n)
    cout << min(abs(sums[L] - sum), abs(sums[R] - sum)) << '\n';
  else
    cout << abs(sums[L] - sum) << '\n';
  while (q--) {
    int l, r, x;
    cin >> l >> r >> x;
    int d = r - l;
    d %= 2;
    if (d == 0) {
      if (l & 1)
        sum += x;
      else
        sum -= x;
    }
    int L = 0;
    int R = m - n + 1;
    while (R - L != 1) {
      if (sums[L + R >> 1] <= sum)
        L = L + R >> 1;
      else
        R = L + R >> 1;
    }
    if (R <= m - n)
      cout << min(abs(sums[L] - sum), abs(sums[R] - sum)) << '\n';
    else
      cout << abs(sums[L] - sum) << '\n';
  }
  return 0;
}
