from decimal import *
from fractions import Fraction
getcontext().prec=60
mod=10**6+3
invs=[0]*mod
invs[1]=1
for i in range(2, mod):
    invs[i]=mod-invs[mod%i]*(mod//i)%mod
def solve(x, v):
    m=len(v)
    if m==0:
        return 1
    s=sum(v)
    if x<s:
        return 0
    elif x==s:
        return 1
    v.sort()
    vs=[]
    cnt2=1
    for i in range(1, m):
        if v[i]!=v[i-1]:
            vs.append((v[i-1], cnt2))
            cnt2=0
        cnt2+=1
    vs.append((v[m-1], cnt2))
    l=Decimal(1)
    r=Decimal(max(v)+2)
    for _ in range(150):
        mid=(l+r)/Decimal(2)
        cnt=0
        for p in vs:
            cnt+=p[1]*int(Decimal(p[0])/(mid-Decimal(1)))
        if cnt<x-s:
            r=mid
        else:
            l=mid
    ret=1
    cnt=0
    f=Fraction(10**19, 1)
    for p in vs:
        k=int(Decimal(p[0])/(l-Decimal(1)))
        if k==0:
          continue
        f=min(f, Fraction(p[0]+k, k))
        cnt+=k*p[1]
        for i in range(p[0]):
            ret=ret*pow((k+i+1)*invs[i+1]%mod, p[1], mod)%mod
    p=f.numerator
    q=f.denominator
    ret*=pow(q, cnt-(x-s), mod)*pow(p, mod-1-(cnt-(x-s))%(mod-1), mod)
    ret%=mod
    return ret
v=[[] for i in range(26)]
x=list(map(int, input().split()))
t=input()
n=len(t)
cnt=1
for i in range(1, n):
    if t[i]!=t[i-1]:
        v[ord(t[i-1])-ord('a')].append(cnt)
        cnt=0
    cnt+=1
v[ord(t[n-1])-ord('a')].append(cnt)
ans=1
for i in range(26):
    a=solve(x[i], v[i])
    #print(a)
    ans=ans*a%mod
print(ans)