#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e17;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
pair<vector<char>,vector<ll>> rle(string s){
    vector<char> cha;vector<ll> num;
    ll a=0,cnt=0;
    char x=s[0];
    while(a<s.size()){
        if(x==s[a])cnt++;
        else{
            cha.push_back(x);num.push_back(cnt);
            x=s[a];cnt=1;
        }
        a++;
    }
    cha.push_back(x);num.push_back(cnt);
    return {cha,num};
}
int main(){
    vector<ll> v(26);rep(i,26)cin >> v[i];
    string t;cin >> t;
    auto [ch,num]=rle(t);
    vvl cnt(26);
    rep(i,ch.size())cnt[ch[i]-'a'].push_back(num[i]);
    bool ok=true;
    rep(i,26){
        ll ret=0;
        for(auto p:cnt[i])ret+=p;
        if(ret>v[i])ok=false;
        v[i]-=ret;
    }
    if(!ok)cout << 0 << endl,exit(0);
    using ld=long double;
    ld ans=1;
    rep(i,26){
        if(cnt[i].empty())continue;
        sort(all(cnt[i]));
        if(cnt[i].size()==1){
            rep(j,cnt[i][0]){
                ans*=cnt[i][0]+v[i]-j;
                ans/=j+1;
                if(ans>=1LL<<62){
                   cout << "hel" << endl;return 0;
                }
            }
            continue;
        }
        if(cnt[i].size()==2&&cnt[i].back()==1){
            ll al=v[i]+2;
            ans*=(al+1)/2;
            ans*=al/2;
            if(ans>=1LL<<62){
                cout << "hel" << endl;return 0;
            }
            continue;
        }
        priority_queue<pair<ld,pair<ll,ll>>> que;
        for(auto p:cnt[i]){
            que.push({p+1,{p+1,p}});
        }
        while(v[i]--){
            auto ret=que.top();que.pop();
            ans*=ret.first;
            if(ans>=1LL<<62){
                cout << "hel" << endl;return 0;
            }
            ret.second.first++;
            ld q=ret.second.first;
            q/=q-ret.second.second;
            que.push({q,ret.second});
        }
    }
    CST(0);
    if(ans>=1LL<<62)cout << "hel" << endl;
    else cout << ans << endl;

}