#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, m, q;
long long sum_a = 0, sum_b[N];
long long ar[N];
long long calc(int l) {
  int r = l + n - 1;
  long long ans = sum_b[r];
  if (l) ans -= sum_b[l - 1];
  if (l % 2) ans = -ans;
  return ans;
}
void output(void) {
  int x = upper_bound(ar, ar + m - n + 1, -sum_a) - ar;
  if (x == m - n + 1)
    cout << abs(sum_a + ar[x - 1]) << "\n";
  else if (x == 0)
    cout << abs(sum_a + ar[x]) << "\n";
  else
    cout << min(abs(sum_a + ar[x - 1]), abs(sum_a + ar[x])) << "\n";
}
void update(int l, int x, int v) {
  if (v % 2) {
    if (l % 2)
      sum_a -= x;
    else
      sum_a += x;
  }
}
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> m >> q;
  for (int i = 0; i < n; ++i) {
    int a;
    cin >> a;
    if (i % 2) a = -a;
    sum_a += a;
  }
  for (int i = 0; i < m; ++i) {
    int b;
    cin >> b;
    if (i % 2 == 0) b = -b;
    sum_b[i] = (i ? sum_b[i - 1] : 0) + b;
  }
  for (int i = 0; i < m - n + 1; ++i) {
    ar[i] = calc(i);
  }
  sort(ar, ar + m - n + 1);
  output();
  while (q--) {
    int l, r, x;
    cin >> l >> r >> x;
    --l, --r;
    update(l, x, (r - l + 1));
    output();
  }
  return 0;
}
