#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e6 + 5;

int dp[maxn],dp2[maxn];
int f[4*maxn];
int a[maxn],t[maxn];
int n,k,d;
priority_queue<pair<int,int>,vector<pair<int,int>>,less<pair<int,int>> > pq[maxn];

void update(int x, int lx, int rx, int l, int r, int val)
{
    if (lx>r||rx<l) return;
    if (lx>=l&&rx<=r)
    {
        f[x]=max(f[x],val);
        return;
    }
    int mid=(lx+rx)/2;
    update(2*x,lx,mid,l,r,val);
    update(2*x+1,mid+1,rx,l,r,val);
}

int get(int x, int lx, int rx, int idx)
{
    if (lx==rx) return f[x];
    int mid=(lx+rx)/2;
    if (idx<=mid) return max(f[x],get(2*x,lx,mid,idx));
    else return max(f[x],get(2*x+1,mid+1,rx,idx));
}

signed main()
{
    ios_base::sync_with_stdio(NULL);
    cin.tie(nullptr); cout.tie(nullptr);
    cin >> n >> k >> d;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int j = 1; j < n; j++) cin >> t[j];
    fill_n(dp,n+1,-1e18);
    fill_n(dp2,n+1,-1e18);
    fill_n(f,4*n+1,-1e18);
//    dp[1] = a[1];
//    int mmax = -1;
//    for (int i = 1; i < n; i++)
//    {
//        mmax = max(mmax, i + t[i]);
////        int lo = (mmax - i) / k * k;
////        for (int j = i + 1; j < i + lo; j++) dp[j] = max(dp[j], a[j] - (j-i)/k*d + dp[i]);
////        for (int j = i + lo; j <= mmax; j++) dp[j] = max(dp[j], a[j] - lo/k*d + dp[i]);
//        for (int j = i + 1; j <= mmax; j++)
//            dp[j] = max(dp[j], a[j] - (j-i)/k*d + dp[i]);
//    }
//    cout << dp[n] << '\n';
    update(1,1,n,1,1,0);
    int mmax = -1;
    for (int i = 1; i <= n; i++)
    {
        while (!pq[i%k].empty() && i >= pq[i%k].top().second) pq[i%k].pop();
        if (!pq[i%k].empty()) dp[i] = max(dp[i], -(i-1)/k*d + pq[i%k].top().first);
        int val2 = dp[i];
        update(1,1,n,i,i+k-1,val2);
        dp[i] = max(dp[i], get(1,1,n,i));
        dp[i] += a[i];
        int val = dp[i];
//        cout << dp[i] << " \n";
        if (i == n) continue;
        mmax = i+t[i];
        int lo = (mmax - i) / k * k;
        update(1,1,n,i+lo,mmax,dp[i] - d * (lo / k));
//        for (int j = 0; j < lo; j += k) update(1,1,n,i+j,i+j+k-1,dp[i] - d * (j / k));
//        cout << i << " : " << i + k - 1 << " & " << lo << '\n';
        if (lo > 0) update(1,1,n,i+1,i+k-1,val);
        pq[i%k].push({dp[i]+(i-1)/k*d,i+lo});

    }
    cout << dp[n] << '\n';

}

/**
15 4 3
-8225 -8961 -5537 -5621 -8143 -5214 -5538 -6912 -6601 -8839 -7872 -7867 -9553 -9793 -7333
4 5 7 4 2 5 1 2 4 5 2 1 2 4
-29940
-29928
**/