跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1979. DZY Loves Strings

    ID: 1985 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 1 上传者: 标签>贪心模拟算法思想编程与模拟入门难度共享题库Codeforces英文题面题目来源题面语言

DZY Loves Strings

题目描述

B. DZY Loves Strings
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

DZY loves collecting special strings which only contain lowercase letters. For each lowercase letter c DZY knows its value wc. For each special string s=s1s2... 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|≤103).

The second line contains a single integer k(0≤k≤103).

The third line contains twenty-six integers from wa to wz. 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.

题目来源：fps-www.educg.net-codeforce-1-2833.xml.zip；FPS 共享题包，题包内第 1562 题。保留原作者与原赛事署名。