#include <bits/stdc++.h>
#define int long long
using namespace std;
int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}
int n,m,q,a[1000001],b[1000001],suma,l,r,w,st,ed,sumb[1000001],ansb[1000001],maxn,minn;
signed main()
{
    n = read();
    m = read();
    q=read();
    for (int i = 1; i <= n; i++)
    {
        a[i] = read();
        suma += a[i]*(i%2?1:-1);
    }
    for (int i = 1; i <= m; i++)
    {
        b[i] = read();
        sumb[i] = sumb[i-1]+b[i]*(i%2?-1:1);
    }
    //puts("");
    for(int i=0;i<=m-n;i++)
    {
        ansb[i]=(sumb[i+n]-sumb[i])*(i%2?-1:1);
        //cout<<sumb[i+n]<<' '<<sumb[i]<<endl;
    }
    //for(int i=0;i<=m-n;i++)
    //{
    //    cout<<ansb[i]<<' '<<suma<<endl;
    //}
    sort(ansb,ansb+m-n+1);
    int wz=lower_bound(ansb,ansb+m-n+1,-suma)-ansb;
    printf("%lld\n",min(abs(ansb[wz]+suma),abs(ansb[wz-1]+suma)));
    while (q--)
    {
        l=read();
        r=read();
        w=read();
        if (l>r)
            swap(l,r);
        if(l==r)
        {
            if (l%2)
                suma+=w;
            else
                suma-=w;
        }
        else if(l%2&&r%2)
        {
            suma+=w;
        }
        else if(l%2==0&&r%2==0)
        {
            suma-=w;
        }
        //cout<<suma<<endl;
        int wz=lower_bound(ansb,ansb+m-n+1,-suma)-ansb;
        printf("%lld\n",min(abs(ansb[wz]+suma),abs(ansb[wz-1]+suma)));
    }
    return 0;
}