#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

const int MM = 1e6 + 3;
const double eps = 1e-8;
const int MAXN = 2e6 + 10;
using int64 = long long;
using int128 = __int128;
const int N = 1e6 + 10;
const int mod = 1e6 + 3;
const int128 denom = 2e20;

int64 fac[mod], inv[mod];

int64 binom(int64 n, int64 m) {
  if (n < m) return 0;
  if (n == m || m == 0) return 1;
  int64 a = n % mod, b = m % mod;
  if (a < b) return 0;
  return fac[a] * inv[fac[b]] * inv[fac[a - b]] % mod * binom(n / mod, m / mod) % mod;
}

ll a[100];
vector<int> s[100];
string str;

int n, m;

void prework(){
  fac[0] = fac[1] = inv[1] = 1;
  for (int i = 2; i < mod; ++i) {
    fac[i] = i * fac[i - 1] % mod;
    inv[i] = (mod - mod / i) * inv[mod % i] % mod;
  }
}

void read(){}

struct node{
	__int128 y, x;
	int num;
};

bool operator < (const node & a, const node & b){
	return a.y * (b.y - b.x) < b.y * (a.y - a.x);
}

ll gao(ll S, vector<int> a){
	//cout << S << ' ' << a.size() << endl;
	ll __sm = 0;
	for (auto &x : a) __sm += x;
	sort(a.begin(), a.end());
	if (__sm > S) return 0ll;
	if (__sm == S) return 1ll;
	if (a.size() == 0) return 1ll;
	if (a.size() == 1)
		return binom(S, a[0]);
	__int128 limit = 2e20;
	__int128 l = limit + 1, r = limit * (a.back() + 1) + 1;
	while(l + 1 < r){
		__int128 m = (r + l) / 2;
		__int128 tot = 0;
		for (auto &x : a){
			tot += x * m / (m - limit);
			if (tot > S) break;
		}
		if (tot > S)
			l = m;
		else
			r = m;
	//	cout << (ll)tot << ' ' << S << endl;
	}
	vector<ll> b;
	priority_queue<node> Q;
	for (auto &x : a){
		ll y = (ll)(x * r / (r - limit));
		Q.push((node){y + 1, x, b.size()});
		b.push_back(y);
		S -= y;
	}
	//cout << "!!!" << S << endl;
	while(S){
		S--;
		node p = Q.top();
		Q.pop();
		b[p.num]++;
		p.y++;
		Q.push(p);
	}
	ll ret = 1;
	for (int i = 0; i < a.size(); i++)
		ret = ret * binom(b[i], a[i]) % mod;
	//cout << "?? " << S << ' ' << a.size() << ' ' << ret << endl;
	return ret;
}

void solve(int casi){
//	cout << "Case #" << casi << ": ";
	for (int i = 0; i < 26; i++)
		cin >> a[i];
	cin >> str;
	str += '+';
	for (int i = 1, j = 0; i < str.length(); i++){
		if (str[i] != str[j]){
			s[str[j]-'a'].push_back(i - j);
			j=i;
		}
	}
	ll ans = 1;
	for (int i = 0; i < 26; i++)
		ans = ans * gao(a[i], s[i]) % MM;
	cout << ans << endl;
}

void printans(){

}


int main(){
	std::ios::sync_with_stdio(false);
	prework();
	int T = 1;
//	cin>>T;
	for(int i = 1; i <= T; i++){
		read();
		solve(i);
		printans();
	}
	return 0;
}