#include <bits/stdc++.h>
using namespace std;
long long a[100005], b[100005], x[100005];
int m, n;
long long lo(long long val) {
  int l = 0;
  int r = m - n;
  long long ans = 1e18;
  while (l <= r) {
    int mid = (l + r) / 2;
    if (x[mid] <= val) {
      ans = abs(val - x[mid]);
      l = mid + 1;
    } else
      r = mid - 1;
  }
  return ans;
}
long long up(long long val) {
  int l = 0;
  int r = m - n;
  long long ans = 1e18;
  while (l <= r) {
    int mid = (l + r) / 2;
    if (x[mid] >= val) {
      ans = abs(val - x[mid]);
      r = mid - 1;
    } else
      l = mid + 1;
  }
  return ans;
}
int main() {
  int q;
  cin >> n >> m >> q;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= m; i++) cin >> b[i];
  long long sum = 0;
  for (int i = 1; i <= n; i++) {
    if (i % 2)
      sum += a[i];
    else
      sum -= a[i];
  }
  for (int i = 1; i <= n; i++) {
    if (i % 2)
      x[0] -= b[i];
    else
      x[0] += b[i];
  }
  for (int i = 1; i <= m - n; i++) {
    x[i] = x[i - 1] + b[i];
    x[i] = x[i] * (-1);
    if (n % 2 == 0)
      x[i] += b[i + n];
    else
      x[i] -= b[i + n];
  }
  sort(x, x + m - n + 1);
  cerr << "x[0]"
       << ": " << x[0] << endl;
  ;
  cerr << "sum"
       << ": " << sum << endl;
  ;
  cout << min(lo(-sum), up(-sum)) << "\n";
  for (int i = 1; i <= q; i++) {
    int l, r, k;
    cin >> l >> r >> k;
    if ((r - l + 1) % 2) {
      if (l % 2)
        sum += k;
      else
        sum -= k;
    }
    cout << min(lo(-sum), up(-sum)) << "\n";
  }
  return 0;
}
