#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD1 = 1e9 + 7, MOD2 = 1e9 + 9;
const int N = 1e5 + 10;
int n, m, q, x, b[N], k[] = {-1, 1};
long long sa = 0LL, tmp, sb[N];
int main() {
  scanf("%d %d %d", &n, &m, &q);
  for (int i = 1; i <= n; i++) scanf("%d", &x), sa += k[i % 2] * x;
  for (int i = 1; i <= m; i++)
    scanf("%d", &b[i]), sb[1] += (i <= n ? k[i % 2] * b[i] : 0);
  for (int i = 2; i + n - 1 <= m; i++)
    sb[i] = -(sb[i - 1] - b[i - 1]) + k[n % 2] * b[i + n - 1];
  sort(sb + 1, sb + m - n + 2);
  sb[0] = -LINF, sb[m - n + 2] = LINF;
  long long ans = LINF;
  tmp = lower_bound(sb + 1, sb + m - n + 1, sa) - sb;
  ans = min(ans, min(abs(sa - sb[tmp]),
                     min(abs(sa - sb[tmp - 1]), abs(sa - sb[tmp + 1]))));
  printf("%lld\n", ans);
  int l, r, x;
  while (q--) {
    scanf("%d %d %d", &l, &r, &x);
    if ((r - l + 1) % 2) sa += k[l % 2] * x;
    tmp = lower_bound(sb + 1, sb + m - n + 1, sa) - sb;
    ans = LINF;
    ans = min(ans, min(abs(sa - sb[tmp]),
                       min(abs(sa - sb[tmp - 1]), abs(sa - sb[tmp + 1]))));
    printf("%lld\n", ans);
  }
}
