#include <bits/stdc++.h>
using namespace std;
struct PSUM {
  int n;
  vector<long long> vll;
  PSUM(int n) : n(n) { vll.assign(n, 0); }
  void build() {
    for (int i = 1; i < n; ++i) {
      vll[i] += vll[i - 1];
    }
  }
  void set(int idx, long long val) { vll[idx] = val; }
  long long query(int lo, int hi) {
    if (lo <= 0) {
      return vll[hi];
    }
    return vll[hi] - vll[lo - 1];
  }
};
struct Segment {
  int n, idx;
  vector<long long> seg, lazy;
  Segment(int n) : n(n) {
    idx = 1;
    while (idx < n) {
      idx <<= 1;
      seg.assign(n * 4, 0);
      lazy.assign(n * 4, 0);
    }
  }
  long long update(int a, int b, long long val, int node, int l, int r) {
    if (r < a || b < l) return seg[node];
    if (lazy[node]) {
      if (l != r) {
        seg[node * 2] += lazy[node] / 2;
        lazy[node * 2] += lazy[node] / 2;
        seg[node * 2 + 1] += lazy[node] / 2;
        lazy[node * 2 + 1] += lazy[node] / 2;
      }
      lazy[node] = 0;
    }
    if (a <= l && r <= b) {
      seg[node] += val * (long long)(r - l + 1);
      lazy[node] += val * (long long)(r - l + 1);
      return seg[node];
    }
    int mid = (l + r) >> 1;
    long long lSum = update(a, b, val, node * 2, l, mid);
    long long rSum = update(a, b, val, node * 2 + 1, mid + 1, r);
    return seg[node] = lSum + rSum;
  }
  long long query(int a, int b, int node, int l, int r) {
    if (r < a || b < l) return 0;
    if (lazy[node]) {
      if (l != r) {
        seg[node * 2] += lazy[node] / 2;
        lazy[node * 2] += lazy[node] / 2;
        seg[node * 2 + 1] += lazy[node] / 2;
        lazy[node * 2 + 1] += lazy[node] / 2;
      }
      lazy[node] = 0;
    }
    if (a <= l && r <= b) return seg[node];
    int mid = (l + r) >> 1;
    long long lSum = query(a, b, node * 2, l, mid);
    long long rSum = query(a, b, node * 2 + 1, mid + 1, r);
    return lSum + rSum;
  }
  void update(int lo, int hi, long long val) {
    if (lo > hi) {
      return;
    }
    update(lo, hi, val, 1, 0, idx - 1);
  }
  long long query(int lo, int hi) {
    if (lo > hi) {
      return 0;
    }
    return query(lo, hi, 1, 0, idx - 1);
  }
};
int n, m, x, y, q;
long long z;
set<long long> B;
long long ABS(long long num) { return num < 0 ? -num : num; }
int getGteEven(int num) { return num % 2 == 0 ? num : num + 1; }
int getGteOdd(int num) { return num % 2 == 1 ? num : num + 1; }
int getLteEven(int num) { return num % 2 == 0 ? num : num - 1; }
int getLteOdd(int num) { return num % 2 == 1 ? num : num - 1; }
long long solve(Segment& odd, Segment& even) {
  long long ans = 98765432123456788LL, sum = even.query(0, n) - odd.query(0, n);
  auto it = B.lower_bound(-sum);
  if (it != B.end()) {
    ans = min(ans, ABS(sum + *it));
  }
  if (it != B.begin()) {
    --it;
    ans = min(ans, ABS(sum + *it));
  }
  return ans;
}
int main() {
  scanf("%d%d%d", &n, &m, &q);
  Segment odd(n + 1), even(n + 1);
  for (int i = 0; i < n; ++i) {
    scanf("%lld", &z);
    if (i & 1) {
      odd.update(i / 2, i / 2, z);
    } else {
      even.update(i / 2, i / 2, z);
    }
  }
  PSUM startOdd(m), startEven(m);
  for (int i = 0; i < m; ++i) {
    scanf("%lld", &z);
    startEven.set(i, (i & 1) ? z : -z);
    startOdd.set(i, (i & 1) ? -z : z);
  }
  startEven.build();
  startOdd.build();
  for (int i = 0; i <= m - n; ++i) {
    int lo = i, hi = i + n - 1;
    if (i & 1) {
      B.insert(startOdd.query(lo, hi));
    } else {
      B.insert(startEven.query(lo, hi));
    }
  }
  printf("%lld\n", solve(odd, even));
  while (q--) {
    scanf("%d%d%lld", &x, &y, &z);
    --x;
    --y;
    if (getGteOdd(x) <= getLteOdd(y)) {
      odd.update(getGteOdd(x) / 2, getLteOdd(y) / 2, z);
    }
    if (getGteEven(x) <= getLteEven(y)) {
      even.update(getGteEven(x) / 2, getLteEven(y) / 2, z);
    }
    printf("%lld\n", solve(odd, even));
  }
}
