#include<bits/stdc++.h>
#define ll long long
#define int long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
#define pii pair<int,int>
#define mk make_pair
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
const int Maxn=1e5+10;
struct node{
    int ch[10];
    int link;
    int ln;
}e[Maxn<<1];
int nod=1,lst=1;
inline int getid(char c){return c-'0';}
inline void add(int x){
    ++nod;e[nod].ln=e[lst].ln+1;
    int p=lst;lst=nod;
    while(p && !e[p].ch[x]){
        e[p].ch[x]=nod;
        p=e[p].link;
    }
    if(!p){
        e[nod].link=1;
        return;
    }
    int q=e[p].ch[x];
    if(e[q].ln==e[p].ln+1){
        e[nod].link=q;
        return;
    }
    int now=nod;
    int cln=++nod;
    e[cln]=e[q];e[cln].ln=e[p].ln+1;
    while(p && e[p].ch[x]==q){e[p].ch[x]=cln;p=e[p].link;}
    e[q].link=e[now].link=cln;
}
int val[20];
char c[Maxn];
int n;
inline int getnewln(int now,int x,int ln){
    while(now!=1 && !e[now].ch[x]) now=e[now].link,ln=e[now].ln;
    if(e[now].ch[x]) ++ln;return ln;
}
int lim[Maxn];
int A,B;
inline void init(){
    scanf("%s",c+1);n=strlen(c+1);
    int id=1,ln=0,now=1;
    fr(i,1,n){
        add(getid(c[i]));
        // cerr<<i<<endl;
        // cout<<i<<' '<<id<<' '<<getnewln(now,getid(c[id]),ln)<<' '<<id-i<<endl;
        while(id<=n && getnewln(now,getid(c[id]),ln)>=id-i){
            // cerr<<id<<endl;
            int x=getid(c[id]);
            while(now!=1 && !e[now].ch[x]) now=e[now].link,ln=e[now].ln;
            if(e[now].ch[x]) ++ln,now=e[now].ch[x];
            lim[id]=i;++id;
        }
    }
    fr(i,0,9) val[i]=read();A=read();B=read();
    // fr(i,1,n) cout<<i<<' '<<lim[i]<<endl;
}
int head,tail,stk[Maxn];
int f[Maxn];
inline void chkmin(int &x,int y){if(x>y) x=y;}
inline void work(){
    head=1,tail=0;
    fr(i,1,n){
        f[i]=f[i-1]+val[getid(c[i])];
        while(head<=tail && stk[head]<lim[i]) ++head;
        if(head<=tail) chkmin(f[i],f[stk[head]]+A*(i-stk[head])+B);
        while(head<=tail && f[i]-A*i<f[stk[tail]]-A*stk[tail]) --tail;
        stk[++tail]=i;
    }writeln(f[n]);
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}