Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. DZY Loves Strings

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputDZY loves collecting special strings which only contain lowercase letters. For each lowercase letter *c* DZY knows its value *w*_{c}. For each special string *s* = *s*_{1}*s*_{2}... *s*_{|s|} (|*s*| is the length of the string) he represents its value with a function *f*(*s*), where

Now DZY has a string *s*. He wants to insert *k* lowercase letters into this string in order to get the largest possible value of the resulting string. Can you help him calculate the largest possible value he could get?

Input

The first line contains a single string *s* (1 ≤ |*s*| ≤ 10^{3}).

The second line contains a single integer *k* (0 ≤ *k* ≤ 10^{3}).

The third line contains twenty-six integers from *w*_{a} to *w*_{z}. Each such number is non-negative and doesn't exceed 1000.

Output

Print a single integer — the largest possible value of the resulting string DZY could get.

Examples

Input

abc

3

1 2 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

Output

41

Note

In the test sample DZY can obtain "abcbbc", *value* = 1·1 + 2·2 + 3·2 + 4·2 + 5·2 + 6·2 = 41.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/11/2021 17:20:01 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|