#include <bits/stdc++.h>
bool debug = 0;
const double PI = acos(-1.0);
const double eps = 1e-9;
using namespace std;
long long b[100100];
long long a;
vector<long long> sum;
int n, m, q;
long long bs() {
  int i = 0;
  int f = sum.size() - 1;
  int m;
  if (debug)
    cout << "a"
         << " = " << (a) << endl;
  while (f > i) {
    m = (i + f) / 2;
    if (debug)
      cout << "i"
           << " = " << (i) << endl;
    if (debug)
      cout << "m"
           << " = " << (m) << endl;
    if (debug)
      cout << "f"
           << " = " << (f) << endl;
    if (debug)
      cout << "a + sum[m]"
           << " = " << (a + sum[m]) << endl;
    if (a + sum[m] >= 0) {
      f = m;
    } else
      i = m + 1;
  }
  long long res = abs(a + sum[0]);
  for (int j = -1; j <= 1; j++) {
    if (j + f < 0 || j + f > sum.size() - 1) continue;
    if (abs(a + sum[j + f]) < res) res = abs(a + sum[j + f]);
  }
  return res;
}
int main() {
  scanf("%d %d %d", &n, &m, &q);
  long long k = 0;
  long long x;
  a = 0;
  k = 1LL;
  for (int i = 0; i < (n); i++) {
    scanf("%lld", &x);
    a += k * x;
    k *= -1LL;
  }
  for (int i = 1; i <= m; i++) {
    scanf("%lld", &b[i]);
  }
  k = -1LL;
  x = 0;
  for (int i = 1; i <= n; i++) {
    x += b[i] * k;
    k *= -1LL;
  }
  sum.push_back(x);
  for (int j = 1; j <= m - n; j++) {
    x += b[1 + j - 1];
    x *= -1LL;
    if (n % 2 == 0) {
      x += b[n + j];
    } else
      x -= b[n + j];
    sum.push_back(x);
  }
  sort(sum.begin(), sum.end());
  sum.resize(distance(sum.begin(), unique(sum.begin(), sum.end())));
  for (long long i : sum) {
    if (debug)
      cout << "i"
           << " = " << (i) << endl;
  }
  printf("%lld\n", bs());
  int k1, k2;
  for (int i = 0; i < q; i++) {
    scanf("%d %d %lld", &k1, &k2, &x);
    if ((k2 - k1 + 1) % 2 == 1) {
      if (k1 % 2 == 0) {
        a -= x;
      } else
        a += x;
    }
    printf("%lld\n", bs());
  }
  return 0;
}
