import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.math.BigDecimal; import java.math.BigInteger; import java.math.MathContext; import java.math.RoundingMode; import java.util.ArrayList; import java.util.Arrays; import java.util.InputMismatchException; import java.util.List; public class N603X { InputStream is; PrintWriter out; String INPUT = ""; void solve() { MathContext cx = new MathContext(100, RoundingMode.FLOOR); long[] a = new long[26]; for(int i = 0;i < 26;i++){ a[i] = nl(); } char[] t = ns().toCharArray(); int m = t.length; int[][] fs = new int[m][]; int p = 0; for(int i = 0;i < t.length;){ int j = i; while(j < t.length && t[j] == t[i])j++; fs[p++] = new int[]{t[i]-'a', j-i}; i = j; } long ans = 1; int[] b = new int[p]; for(int c = 0;c < 26;c++){ int q = 0; for(int i = 0;i < p;i++){ if(fs[i][0] == c){ b[q++] = fs[i][1]; } } if(q == 0)continue; Arrays.sort(b, 0, q); int[] lcs = new int[q]; int[] lfs = new int[q]; int r = 0; int num = 0; for(int i = 0;i < q;){ int j = i; while(j < q && b[j] == b[i])j++; lcs[r] = b[i]; lfs[r] = j-i; num += (long)b[i] * (j-i); r++; i = j; } if(a[c] < num){ out.println(0); return; } BigDecimal low = BigDecimal.valueOf(1e-7); BigDecimal high = BigDecimal.valueOf(1e19); for(int rep = 0;rep < 150;rep++){ BigDecimal h = low.add(high).divide(BigDecimal.valueOf(2), cx); // (x+c)/x >= h // c/x >= h-1 // x <= c/(h-1) double alld = 0; long all = 0; for(int j = 0;j < r;j++){ BigDecimal z = BigDecimal.valueOf(lcs[j]).multiply(h, cx); long k = z.longValue(); alld += z.doubleValue() * lfs[j]; all += k * lfs[j]; } if(all <= a[c] && alld <= 2e18){ low = h; }else{ high = h; } } BigDecimal h = low; long all = 0; BigInteger maxnum = BigInteger.ZERO; BigInteger maxden = BigInteger.ONE; List argjs = new ArrayList<>(); int mod = 1000003; for(int j = 0;j < r;j++){ long k = BigDecimal.valueOf(lcs[j]).multiply(h, cx).longValue(); all += k * lfs[j]; BigInteger lnum = BigInteger.valueOf(lcs[j]); BigInteger lden = BigInteger.valueOf(k); int comp = maxnum.multiply(lden).compareTo(maxden.multiply(lnum)); if(comp < 0){ maxnum = lnum; maxden = lden; argjs.clear(); argjs.add(j); }else if(comp == 0){ argjs.add(j); } ans = ans * pow(C(k, lcs[j], mod), lfs[j], mod) % mod; } for(int argj : argjs){ long k = BigDecimal.valueOf(lcs[argj]).multiply(h, cx).longValue(); long rem = Math.min(lfs[argj], a[c] - all); all += rem; ans = ans * invl(pow(C(k, lcs[argj], mod), rem, mod), mod) % mod; ans = ans * pow(C(k+1, lcs[argj], mod), rem, mod) % mod; } } out.println(ans); } static long C(long n, long r, int mod) { n %= mod; if(n < 0 || r < 0 || r > n)return 0; long ret = 1; long den = 1; for(int i = 1;i <= r;i++){ ret = ret * (n-i+1) % mod; den = den * i % mod; } return ret * invl(den, mod) % mod; } public static long invl(long a, long mod) { long b = mod; long p = 1, q = 0; while (b > 0) { long c = a / b; long d; d = a; a = b; b = d % b; d = p; p = q; q = d - c * q; } return p < 0 ? p + mod : p; } public static long pow(long a, long n, long mod) { a %= mod; long ret = 1; int x = 63 - Long.numberOfLeadingZeros(n); for (; x >= 0; x--) { ret = ret * ret % mod; if (n << 63 - x < 0) ret = ret * a % mod; } return ret; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new N603X().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }