#pragma GCC optimize("O3,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define Z 4096
int n,k,p=Z,q,i,a[5000001],j;
deque<int> d;
long long z;
char s[Z],t[Z];
inline char A()
{
    if(p==Z)
        fread(s,1,Z,stdin),p=0;
    return s[p++];
}
int B()
{
    char c;
    for(c=A();!isdigit(c)&&c!='-';c=A());
    int n=0,r=1;
    if(c=='-')
        r=-1,c=A();
    for(;isdigit(c);n=n*10+c-48,c=A());
    return n*r;
}
int main()
{
    for(freopen("deque.in","r",stdin),freopen("deque.out","w",stdout),n=B(),k=B(),i=1;i<=n;a[i++]=B());
    for(i=1;i<=k;d.push_back(i++))
        for(;!d.empty()&&a[d.back()]>a[i];d.pop_back());
    for(z+=a[d.front()],i=k+1;i<=n;d.push_back(i++),z+=a[d.front()]) {
        for(++j;!d.empty()&&d.front()<=j;d.pop_front());
        for(;!d.empty()&&a[d.back()]>a[i];d.pop_back());
    }
    for(n=B(),k=B(),i=1;i<=n;++i) {
        for(a[i]=B();!d.empty()&&a[d.back()]>=a[i];d.pop_back());
        if(d.push_back(i),i-k==d.front())
            d.pop_front();
        if(i>=k)
            z+=a[d.front()];
    }
    return printf("%lld",z),0;
}