#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 3e7+;

int x[maxn], dq[maxn], pos[maxn];

int main()

{

    freopen("minima.in","r",stdin);

    freopen("minima.out","w",stdout);

    int n,m,k; cin>>n>>m>>k;

    ll a,b,c; cin>>a>>b>>c;

    for(int i = ; i <= k; i++) scanf("%d",x+i);

    for(int i = k+; i <= n; i++){

        ll t = a*x[i-]+b*x[i-]+c;

        x[i] = t;

    }

    int l = ,r = ;

    ll ans = ;

    for(int i = ; i <= n; i++){

        while(r>l && dq[r-]>=x[i]) r--;

        dq[r] = x[i];

        pos[r++] = i;

        if(i-pos[l] >= m) l++;

        if(i>=m) ans+= dq[l];

    }

    printf("%I64d\n",ans);

    return ;

}