import sys import numpy as np read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines MOD = 10**6 + 3 S = tuple(map(int, readline().split())) T = tuple(x - ord('a') for x in read().rstrip()) L = [[] for _ in range(26)] last_ch = -1 last_len = 0 for x in T: if x != last_ch: L[x].append(1) else: L[x][-1] += 1 last_ch = x def check_zero(S, L): for a in range(26): # if S[a] > 0 and (not L[a]): # return True if S[a] < sum(L[a]): return True if check_zero(S, L): print(0) exit() def cumprod(A, MOD=MOD): L = len(A) Lsq = int(L**.5 + 1) A = np.resize(A, Lsq**2).reshape(Lsq, Lsq) for n in range(1, Lsq): A[:, n] *= A[:, n - 1] A[:, n] %= MOD for n in range(1, Lsq): A[n] *= A[n - 1, -1] A[n] %= MOD return A.ravel()[:L] def make_fact(U, MOD=MOD): x = np.arange(U, dtype=np.int64) x[0] = 1 fact = cumprod(x, MOD) x = np.arange(U, 0, -1, dtype=np.int64) x[0] = pow(int(fact[-1]), MOD - 2, MOD) fact_inv = cumprod(x, MOD)[::-1] fact.flags.writeable = False fact_inv.flags.writeable = False return fact, fact_inv fact, fact_inv = make_fact(MOD) def compute(n, nums): if not nums: return 1 nums = np.asarray(nums, np.int64) s = n - nums.sum() low = 0 # low * k 以下は全部とる high = 10**20 for _ in range(100): x = (low + high) / 2 a = np.floor(x * nums) if a.sum() <= s: low = x else: high = x n1 = nums + np.floor(low * nums).astype(np.int64) n2 = nums + np.floor(high * nums).astype(np.int64) I = np.where(n1 < n2)[0] r = n - n1.sum() n1[I[:r]] += 1 n = n1 k = nums # nCkの積を計算しよう n %= MOD if np.any(n < k): return 0 x = fact[n] * fact_inv[k] * fact_inv[n - k] % MOD return cumprod(x)[-1] x = 1 for n, nums in zip(S, L): x *= compute(n, nums) x %= MOD print(x)