#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<queue>
#define INF 0x3f3f3f3f
using namespace std;
int n,a,b,f,fa,fb,s,t,head[2005],c[2005],dis[2005],pre[2005],cnt=0;
bool inq[2005];
struct Node
{int next,from,to,cap,w;
}Edges[50005];
int read()
{int x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}return x*f;
}
void addedge(int u,int v,int c,int w)
{Edges[cnt].next=head[u];head[u]=cnt;Edges[cnt].from=u;Edges[cnt].to=v;Edges[cnt].cap=c;Edges[cnt++].w=w;
}
void insert(int u,int v,int c,int w)
{addedge(u,v,c,w);addedge(v,u,0,-w);
}
queue<int>q;
int MCMF()
{int cost=0,flow=0;while(1){memset(c,0,sizeof(c));memset(dis,0x3f,sizeof(dis));q.push(s);inq[s]=1,dis[s]=0,c[s]=INF,pre[s]=-1;while(!q.empty()){int u=q.front();q.pop(),inq[u]=0;for(int i=head[u];~i;i=Edges[i].next){int v=Edges[i].to;if(dis[v]>dis[u]+Edges[i].w&&Edges[i].cap>0){dis[v]=dis[u]+Edges[i].w;c[v]=min(c[u],Edges[i].cap);pre[v]=i;if(!inq[v])inq[v]=1,q.push(v);}}}if(!c[t])break;cost+=c[t]*dis[t];flow+=c[t];int p=t;while(pre[p]!=-1){Edges[pre[p]].cap-=c[t];Edges[pre[p]^1].cap+=c[t];p=Edges[pre[p]].from;}}return cost;
}
int main()
{memset(head,-1,sizeof(head));n=read(),a=read(),b=read(),f=read(),fa=read(),fb=read();s=0,t=2*n+1;for(int i=1;i<=n;i++){int x=read();insert(s,i,x,0);insert(i+n,t,x,0);insert(s,i+n,INF,f);if(i+a+1<=n)insert(i,i+a+1+n,INF,fa);if(i+b+1<=n)insert(i,i+b+1+n,INF,fb);if(i+1<=n)insert(i,i+1,INF,0);}printf("%d\n",MCMF());return 0;
}