#include <bits/stdc++.h>
using namespace std;
long long n, m, Q;
long long a[100005], b[100005];
long long asum[2][100005], bsum[2][100005];
vector<long long> vec;
int main(void) {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> Q;
  for (long long(i) = (1); (i) <= (n); (i)++) cin >> a[i];
  for (long long(i) = (1); (i) <= (m); (i)++) cin >> b[i];
  for (long long(i) = (1); (i) <= (n); (i)++) {
    asum[0][i] = asum[0][i - 1];
    asum[1][i] = asum[1][i - 1];
    asum[i % 2][i] += a[i];
  }
  for (long long(i) = (1); (i) <= (m); (i)++) {
    bsum[0][i] = bsum[0][i - 1];
    bsum[1][i] = bsum[1][i - 1];
    bsum[i % 2][i] += b[i];
  }
  long long sum = asum[1][n] - asum[0][n];
  for (long long(i) = (1); (i) <= (m); (i)++) {
    long long r = i + n - 1;
    if (r > m) break;
    vec.push_back(-(bsum[(i + 1) % 2][r] - bsum[(i + 1) % 2][i - 1]) +
                  (bsum[i % 2][r] - bsum[i % 2][i - 1]));
  }
  sort((vec).begin(), (vec).end());
  long long p = lower_bound((vec).begin(), (vec).end(), sum) - vec.begin();
  long long ans = 1e18;
  if (p < vec.size()) (ans) = min((ans), (abs(vec[p] - sum)));
  if (p - 1 >= 0) (ans) = min((ans), (abs(vec[p - 1] - sum)));
  cout << ans << "\n";
  long long l, r, x;
  for (long long(q) = (1); (q) <= (Q); (q)++) {
    cin >> l >> r >> x;
    long long e = r / 2 - (l - 1) / 2, o = r - l + 1 - e;
    ;
    sum += o * x - e * x;
    long long p = lower_bound((vec).begin(), (vec).end(), sum) - vec.begin();
    long long ans = 1e18;
    if (p < vec.size()) (ans) = min((ans), (abs(vec[p] - sum)));
    if (p - 1 >= 0) (ans) = min((ans), (abs(vec[p - 1] - sum)));
    cout << ans << "\n";
  }
  flush(cout);
  return 0;
}
