#include <bits/stdc++.h>
using namespace std;
long long arr[200111];
set<long long> s;
void solve(long long x) {
  long long ans = (1LL << 55);
  auto it1 = s.lower_bound(x);
  auto it2 = s.lower_bound(x);
  if (it1 != s.begin()) it2 = prev(it1);
  if (it1 != s.end()) ans = min(ans, llabs(*it1 - x));
  if (it1 != s.begin()) ans = min(ans, llabs(*it2 - x));
  printf("%lld\n", ans);
}
int main() {
  long long n, m, q, sum = 0, sum2 = 0;
  scanf("%lld%lld%lld", &n, &m, &q);
  for (long long i = 0; i < n; i++) {
    long long a;
    scanf("%lld", &a);
    sum += a * (i & 1 ? -1 : 1);
  }
  for (long long i = 0; i < n; i++) {
    scanf("%lld", arr + i);
    sum2 += arr[i] * (i & 1 ? -1 : 1);
  }
  s.insert(sum2);
  for (long long i = n; i < m; i++) {
    scanf("%lld", arr + i);
    sum2 -= arr[i - n];
    sum2 *= -1;
    sum2 += arr[i] * (n & 1 ? 1 : -1);
    s.insert(sum2);
  }
  solve(sum);
  while (q--) {
    long long l, d, a;
    scanf("%lld%lld%lld", &l, &d, &a);
    if ((d - l + 1) & 1) sum += a * (d & 1 ? 1 : -1);
    solve(sum);
  }
  return 0;
}
