#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

struct Node {
    int len, link, nxt[10];
} p[N << 1];

char s[N];
int n, val[10], lst = 1, tot = 1;

void extend(int c) {
    int cur = ++tot, z = lst;
    p[cur].len = p[z].len + 1;
    while (z && !p[z].nxt[c]) p[z].nxt[c] = cur, z = p[z].link;
    if (!p[z].nxt[c]) p[cur].link = 1;
    else {
        int v = p[z].nxt[c];
        if (p[v].len + 1 == p[z].len) {
            p[cur].link = v;
        } else {
            int clo = ++tot;
            p[clo] = p[v];
            p[clo].len = p[z].len + 1;
            while (z && p[z].nxt[c] == v) {
                p[z].nxt[c] = clo;
                z = p[z].link;
            }
            p[cur].link = p[v].link = clo;
        }
    }
    lst = cur;
}

int calc(int now, int ch, int len) {
    while (now && !p[now].nxt[ch]) {
        now = p[now].link;
        len = p[now].len;
    }
    if (p[now].nxt[ch]) {
        now = p[now].nxt[ch];
        ++len;
    }
    return len;
}

int d[N], f[N], mn[N];

void modify(int x, int y) {
    for (; x; x -= x & -x) mn[x] = min(mn[x], y);
}

int query(int x) {
    int res = 1e9;
    for (; x <= n; x += x & -x) res = min(res, mn[x]);
    return res;
}

signed main() {
    scanf("%s", s + 1);
    n = strlen(s + 1);
    for (int i = 0; i < 10; ++i) scanf("%d", &val[i]);
    int a, b; scanf("%d%d", &a, &b);
    for (int i = 1, j = 1, t = 0, now = 1, len = 0; i <= n; ++i) {
        extend(s[i] - '0');
        while (t < n && calc(now, s[t + 1] - '0', len) >= t - i + 1) {
            int ch = s[++t] - '0';
            while (now && !p[now].nxt[ch]) {
                now = p[now].link;
                len = p[now].len;
            }
            if (p[now].nxt[ch]) {
                now = p[now].nxt[ch];
                ++len;
            }
        }
        while (j <= t) d[j++] = i + 1;
    }
    for (int i = 1; i <= n; ++i) mn[i] = 1e9;
    for (int i = 1; i <= n; ++i) {
        f[i] = f[i - 1] + val[s[i] - '0'];
        f[i] = min(f[i], query(d[i] - 1) + i * a + b);
        modify(i, f[i] - i * a);
    }
    printf("%d\n", f[n]);
    return 0;
}