#include <bits/stdc++.h>
using namespace std;
template <typename T>
T in() {
  char ch;
  T n = 0;
  bool ng = false;
  while (1) {
    ch = getchar();
    if (ch == '-') {
      ng = true;
      ch = getchar();
      break;
    }
    if (ch >= '0' && ch <= '9') break;
  }
  while (1) {
    n = n * 10 + (ch - '0');
    ch = getchar();
    if (ch < '0' || ch > '9') break;
  }
  return (ng ? -n : n);
}
template <typename T>
inline T POW(T B, T P) {
  if (P == 0) return 1;
  if (P & 1)
    return B * POW(B, P - 1);
  else
    return (POW(B, P / 2) * POW(B, P / 2));
}
template <typename T>
inline T Gcd(T a, T b) {
  if (a < 0) return Gcd(-a, b);
  if (b < 0) return Gcd(a, -b);
  return (b == 0) ? a : Gcd(b, a % b);
}
template <typename T>
inline T Lcm(T a, T b) {
  if (a < 0) return Lcm(-a, b);
  if (b < 0) return Lcm(a, -b);
  return a * (b / Gcd(a, b));
}
long long Bigmod(long long base, long long power, long long MOD) {
  long long ret = 1;
  while (power) {
    if (power & 1) ret = (ret * base) % MOD;
    base = (base * base) % MOD;
    power >>= 1;
  }
  return ret;
}
bool isVowel(char ch) {
  ch = toupper(ch);
  if (ch == 'A' || ch == 'U' || ch == 'I' || ch == 'O' || ch == 'E')
    return true;
  return false;
}
template <typename T>
long long int isLeft(T a, T b, T c) {
  return (a.x - b.x) * (b.y - c.y) - (b.x - c.x) * (a.y - b.y);
}
long long ModInverse(long long number, long long MOD) {
  return Bigmod(number, MOD - 2, MOD);
}
bool isConst(char ch) {
  if (isalpha(ch) && !isVowel(ch)) return true;
  return false;
}
int toInt(string s) {
  int sm;
  stringstream second(s);
  second >> sm;
  return sm;
}
long long int a[200007];
long long int b[200007];
long long int od[200007], ev[200007], sm[200007];
long long int tree[200007 * 4];
long long int lz[200007 * 4];
int lzy[200007 * 4];
int st, ed;
long long int odd(long long int l, long long int r) {
  long long int ans = (r - l + 1) / 2;
  if (l % 2 && r % 2) ans++;
  return ans;
}
long long int even(long long int l, long long int r) {
  long long int ans = (r - l + 1) / 2;
  if (l % 2 == 0 && r % 2 == 0) ans++;
  return ans;
}
void up(int id, int l, int r, long long int v) {
  lzy[id] = 0;
  lz[id * 2] += v;
  lz[id * 2 + 1] += v;
  lz[id] = 0;
  lzy[id * 2] = 1;
  lzy[id * 2 + 1] = 1;
  tree[id] += odd(l, r) * v;
  tree[id] -= even(l, r) * v;
}
void upd(int id, int l, int r, long long int vl) {
  if (r < st || l > ed) return;
  int mid = (l + r) / 2, lft = 2 * id, rgt = lft + 1;
  if (lzy[id]) {
    up(lft, l, mid, lz[id]);
    up(rgt, mid + 1, r, lz[id]);
    lzy[id] = 0;
    lz[id] = 0;
    tree[id] = tree[lft] + tree[rgt];
  }
  if (st <= l && ed >= r) {
    up(id, l, r, vl);
    return;
  }
  if (ed <= mid) {
    upd(lft, l, mid, vl);
  } else if (st > mid) {
    upd(rgt, mid + 1, r, vl);
  } else {
    upd(rgt, mid + 1, r, vl);
    upd(lft, l, mid, vl);
  }
  tree[id] = tree[lft] + tree[rgt];
}
vector<long long int> v;
void Ans(long long int b) {
  long long int ans = 2000000000000000000LL;
  int tp = lower_bound(v.begin(), v.end(), -b) - v.begin();
  int s = tp - 15;
  s = max(0, s);
  int e = ((v.size() - 1 < tp + 15) ? v.size() - 1 : tp + 15);
  for (int i = s; i < e + 1; i++) {
    long long int tp = abs(v[i] + b);
    ans = min(ans, tp);
  }
  printf("%lld\n", ans);
}
int main() {
  int n, m, q;
  n = in<int>(), m = in<int>(), q = in<int>();
  for (int i = 1; i < n + 1; i++) {
    a[i] = in<long long int>();
    st = i, ed = i;
    upd(1, 1, n, a[i]);
  }
  for (int i = 1; i < m + 1; i++) {
    b[i] = in<long long int>();
  }
  for (int i = 1; i <= m; i++) {
    od[i] = od[i - 1];
    ev[i] = ev[i - 1];
    sm[i] = sm[i - 1] + b[i];
    if (i % 2)
      od[i] += b[i];
    else
      ev[i] += b[i];
  }
  for (int i = 1; i < m + 1; i++) {
    int st = i, ed = i + n - 1;
    if (ed > m) break;
    long long int nw = (sm[ed] - sm[st - 1]);
    if (i % 2 == 0) {
      nw -= (ev[ed] - ev[st - 1]) * 2LL;
    } else {
      nw -= (od[ed] - od[st - 1]) * 2LL;
    }
    v.push_back(nw);
  }
  sort(v.begin(), v.end());
  long long int vvv = tree[1];
  Ans(tree[1]);
  while (q--) {
    st = in<int>(), ed = in<int>();
    long long int v;
    v = in<long long int>();
    upd(1, 1, n, v);
    vvv += odd(st, ed) * v;
    vvv -= even(st, ed) * v;
    Ans(vvv);
  }
  return 0;
}
