#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const long long INF = 0x3f3f3f3f3f3f3f3f;
int n, m, q;
long long a[N], b[N];
long long asum, bsum[N];
int main() {
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%I64d", &a[i]);
  }
  for (int i = 1; i <= m; i++) {
    scanf("%I64d", &b[i]);
  }
  bool sgn = false;
  for (int i = 1; i <= n; i++) {
    if (sgn)
      bsum[1] -= b[i];
    else
      bsum[1] += b[i];
    sgn = !sgn;
  }
  sgn = !sgn;
  for (int i = 2; i <= m - n + 1; i++) {
    bsum[i] = -(bsum[i - 1] - b[i - 1]);
    if (sgn)
      bsum[i] -= b[i + n - 1];
    else
      bsum[i] += b[i + n - 1];
  }
  sort(bsum + 1, bsum + m - n + 2);
  sgn = false;
  for (int i = 1; i <= n; i++) {
    if (sgn)
      asum -= a[i];
    else
      asum += a[i];
    sgn = !sgn;
  }
  for (int i = 0; i <= q; i++) {
    int l, r;
    long long x;
    if (i > 0)
      scanf("%d%d%I64d", &l, &r, &x);
    else
      l = 0, r = 1;
    if ((r - l + 1) % 2 == 1) {
      if (l % 2 == 0)
        asum -= x;
      else
        asum += x;
    }
    int p = lower_bound(bsum + 1, bsum + m - n + 2, asum) - bsum;
    long long diff = INF;
    if (p <= m - n + 1) diff = abs(asum - bsum[p]);
    if (p > 1) diff = min(diff, abs(asum - bsum[p - 1]));
    printf("%I64d\n", diff);
  }
  return 0;
}
