#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5;
long long prefixA = 0;
long long prefixB[maxn + 10];
long long sumB[maxn + 10];
long long b[maxn + 10];
void solve() {
  int n, m, q;
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 1; i <= n; i++) {
    long long x;
    scanf("%lld", &x);
    if (i & 1) {
      prefixA += x;
    } else
      prefixA -= x;
  }
  sumB[0] = 0;
  for (int i = 1; i <= m; i++) {
    scanf("%lld", &b[i]);
    if (i & 1) {
      sumB[i] = sumB[i - 1] + b[i];
    } else {
      sumB[i] = sumB[i - 1] - b[i];
    }
  }
  for (int i = 1; i <= m - n + 1; i++) {
    if (!(i & 1)) {
      prefixB[i - 1] = sumB[i - 1 + n] - sumB[i - 1];
    } else {
      prefixB[i - 1] = sumB[i - 1] - sumB[i - 1 + n];
    }
  }
  sort(prefixB, prefixB + m - n + 1);
  int pos = lower_bound(prefixB, prefixB + m - n + 1, -prefixA) - prefixB;
  pos = min(pos, m - n);
  printf("%lld\n", min(min(abs(prefixA + prefixB[max(pos - 1, 0)]),
                           abs(prefixA + prefixB[pos])),
                       abs(prefixA + prefixB[min(pos + 1, m - n)])));
  while (q--) {
    long long l, r, x;
    scanf("%lld%lld%lld", &l, &r, &x);
    if ((r - l + 1) & 1) {
      if (l & 1) {
        prefixA += x;
      } else {
        prefixA -= x;
      }
    }
    pos = lower_bound(prefixB, prefixB + m - n + 1, -prefixA) - prefixB;
    pos = min(pos, m - n);
    printf("%lld\n", min(min(abs(prefixA + prefixB[max(pos - 1, 0)]),
                             abs(prefixA + prefixB[pos])),
                         abs(prefixA + prefixB[min(pos + 1, m - n)])));
  }
}
int main() {
  solve();
  return 0;
}
