*a, = map(int,input().split())
d = {}
t = input()+"Z"
ren = -1
cnt = 0
now = "A"
for i in t:
    if i == now:
        cnt += 1
    else:
        if now in d: d[now].append(cnt)
        else: d[now] = [cnt]
        now = i
        cnt = 1
        ren += 1
V = [0]*26
from heapq import *
for i,ai in enumerate(a):
    s = chr(i+97)
    if ai==0 or (ai != 0 and s not in d): continue
    ds = d[s]
    v = ai - sum(ds)
    V[i] = v
    if v < 0:
        print(0)
        exit()

ans = 1
MAX = 1<<62
for i,ai in enumerate(a):
    s = chr(i+97)
    if ai==0 or (ai != 0 and s not in d): continue
    v = V[i]
    if v==0:
        continue
    # 倍率、先頭、長さ    
    q = [(-(i+1.0),i,i) for i in d[s]]
    heapify(q)
    #print(chr(i+97),v,d[chr(i+97)])
    for _ in range(v):
        _,x,y = heappop(q)
        ans = ans*(y+1)//(y-x+1)
        heappush(q,(-(y+2)/(y+2-x),x,y+1))        
        if ans > MAX:
            print("hel")
            exit()
print(ans)