#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N], b[N];
int main() {
  int n, m, q;
  long long suma = 0;
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    if (i & 1)
      suma += a[i];
    else
      suma -= a[i];
  }
  int l = 1;
  long long ee = 0, oo = 0;
  vector<long long> v;
  for (int i = 1; i <= m; i++) {
    scanf("%d", &b[i]);
    if (i > n) {
      if (l & 1)
        oo -= b[l];
      else
        ee -= b[l];
      l++;
    }
    if (i & 1)
      oo += b[i];
    else
      ee += b[i];
    if (i >= n) {
      long long temp = 0;
      if (l & 1)
        temp = oo - ee;
      else
        temp = ee - oo;
      v.push_back(temp);
    }
  }
  sort(v.begin(), v.end());
  q++;
  bool f = 0;
  while (q--) {
    int l, r, x;
    if (f)
      scanf("%d%d%d", &l, &r, &x);
    else
      l = 0, r = 0, x = 0;
    if ((l & 1) && (r & 1))
      suma += x;
    else if (((l & 1) == 0) && ((r & 1) == 0))
      suma -= x;
    int in = lower_bound(v.begin(), v.end(), suma) - v.begin();
    long long ans = 1e18;
    for (int i = max(0, in - 2); i < min(in + 2, (int)v.size()); i++) {
      ans = min(ans, llabs(suma - v[i]));
    }
    printf("%I64d\n", ans);
    f = 1;
  }
  return 0;
}
