/////////////////////////////////////// // Author : Dhruv Khattar // ///////////////////////////////////// #include #define mod 1000000007 #define rep(i,j,N) for( int i=j ; i=j ; i-- ) #define si(i) scanf("%d",&i) #define sl(i) scanf("%lld",&i) #define pi(i) printf("%d",i) #define pl(i) printf("%lld",i) #define pin(i) printf("%d\n",i) #define pln(i) printf("%lld\n",i) #define ps printf(" ") #define pn printf("\n") #define pb push_back #define mp make_pair #define ff first #define ss second #define sz(a) int((a).size()) #define tr(c,i) for(typeof((c).begin())i = (c).begin(); i != (c).end(); i++) #define all(a) (a).begin(),(a).end() #define rall(a) (a).rbegin(),(a).rend() #define present(a,x) (find(all(a),x) != (a).end()) #define cpresent(c,x) ((c).find(x) != (c).end()) using namespace std; typedef long long ll; typedef vector vi; typedef vector vvi; typedef vector vl; typedef pair ii; typedef vector vii; int main() { vi v; int x; rep(i,0,26) { si(x); v.pb(x); } char s[11]; scanf("%s",s); int ans = strlen(s); int yo = 0; rep(i,0,ans) { yo = max(yo,v[s[i]-'a']); } pin(yo*ans); return 0; }