import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } enum INF = 1L << 62; enum M = 26; long[] S; string T; void main() { try { for (; ; ) { S = new long[M]; foreach (i; 0 .. M) { S[i] = readLong(); } T = readToken(); auto lss = new long[][M]; foreach (t; T.group) { lss[t[0] - 'a'] ~= t[1]; } long ans = 1; foreach (i; 0 .. M) { const ls = lss[i]; const len = cast(int)(ls.length); if (len > 0) { const sumL = ls.sum; const s = S[i] - sumL; if (s < 0) { ans = 0; break; } debug { writeln(cast(char)('a' + i), ": s = ", s, ", ls = ", ls); } /* decr. order of (l + x) / x <=> incr. order of x / l */ auto xs = new long[len]; foreach (j; 0 .. len) { // floor(s * ls[j] / sumL) const q = s / sumL, r = s % sumL; xs[j] = q * ls[j] + r * ls[j] / sumL; } long ss = s - xs.sum; debug { writeln(" ss = ", ss); writeln(" xs = ", xs); } // compare (xs[j] + 1) / ls[j] auto qs = new long[len], rs = new long[len]; foreach (j; 0 .. len) { qs[j] = (xs[j] + 1) / ls[j]; rs[j] = (xs[j] + 1) % ls[j]; } BinaryHeap!(Array!int, (j0, j1) => ((qs[j0] != qs[j1]) ? (qs[j0] > qs[j1]) : (rs[j0] * ls[j1] > rs[j1] * ls[j0]))) q; foreach (j; 0 .. len) { q.insert(j); } for (; ss > 0; --ss) { const j = q.front; q.removeFront; ++xs[j]; qs[j] = (xs[j] + 1) / ls[j]; rs[j] = (xs[j] + 1) % ls[j]; q.insert(j); } debug { writeln(" xs = ", xs); } long tmp = 1; foreach (j; 0 .. len) { // tmp *= binom(ls[j] + xs[j], ls[j]); foreach (k; 1 .. ls[j] + 1) { // tmp * (xs[j] + k) / k > INF if (tmp / k > INF / (xs[j] + k)) { tmp = INF; goto done; } tmp *= (xs[j] + k); tmp /= k; } } done: if (ans > INF / tmp) { ans = INF; } else { ans *= tmp; } } } if (ans >= INF) { writeln("hel"); } else { writeln(ans); } } } catch (EOFException e) { } }