#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int SIZE = 1e6 + 10;
int b[SIZE];
void answer(vector<long long>& d, long long v) {
  int it = lower_bound((d).begin(), (d).end(), -v) - d.begin();
  long long an = 1e18;
  if (it != ((int)(d).size())) an = min(an, abs(d[it] + v));
  it--;
  if (it >= 0) an = min(an, abs(d[it] + v));
  printf("%I64d\n", an);
}
int main() {
  int n, m, q;
  scanf("%d%d%d", &n, &m, &q);
  long long base = 0;
  for (int i = 0; i < (n); ++i) {
    int(x);
    scanf("%d", &x);
    if (i & 1)
      base -= x;
    else
      base += x;
  }
  long long now = 0;
  vector<long long> d;
  for (int i = (1); i < (m + 1); ++i) {
    scanf("%d", &(b[i]));
    if (i & 1)
      now -= b[i];
    else
      now += b[i];
    if (i >= n) {
      if ((i - n) % 2 == 0)
        d.push_back(now);
      else
        d.push_back(-now);
      if ((i - n + 1) & 1)
        now += b[i - n + 1];
      else
        now -= b[i - n + 1];
    }
  }
  sort((d).begin(), (d).end());
  answer(d, base);
  while (q--) {
    int x, y, v;
    scanf("%d%d%d", &x, &y, &v);
    if ((y - x + 1) % 2 == 1) {
      if (x & 1)
        base += v;
      else
        base -= v;
    }
    answer(d, base);
  }
  return 0;
}
