DZY Loves Strings

题意翻译

已知一个只含有小写字母的字符串$S$以及每个字符的价值$W_c$，定义字符串的价值$val=\sum_{i=1}^{len} i * W_{S_i}$，现在需要插入$k$个字符使得最后的字符串价值尽可能大，请输出这个最大价值。

题目描述

DZY 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?

输入输出格式

输入格式

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 $ .

输出格式

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

输入输出样例

输入样例 #1

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

输出样例 #1

41

说明

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