#include <cstdio> #include <cmath> #include <iostream> #include <set> #include <algorithm> #include <vector> #include <map> #include <cassert> #include <string> #include <cstring> #include <queue> using namespace std; #define rep(i,a,b) for(int i = a; i < b; i++) #define S(x) scanf("%d",&x) #define S2(x,y) scanf("%d%d",&x,&y) #define P(x) printf("%d\n",x) #define all(v) v.begin(),v.end() #define FF first #define SS second typedef long long int LL; typedef pair<int, int > pii; typedef vector<int > vi; int A[26]; int main() { rep(i,0,26) S(A[i]); string s; cin >> s; int ans = s.size(); int mx = 0; rep(i,0,s.size()) { mx = max(mx, A[s[i]-'a']); } P(ans*mx); return 0; }