import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, 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 B = 10; void main() { try { for (; ; ) { const N = readInt(); const K = readLong(); auto C = new int[B]; foreach (x; 1 .. B) { C[x] = readInt(); } int[] xs; foreach (x; 1 .. B) { foreach (_; 0 .. C[x]) { xs ~= x; } } assert(xs.length == N); const half = N / 2; long ten = 1 % K; foreach (_; 0 .. half) { ten *= 10; ten %= K; } auto yss = new long[][][](2, 1 << N); void dfs(int s, int pos, int used, long y) { if (pos == (s ? (N - half) : half)) { yss[s][used] ~= y; } else { foreach (u; 0 .. N) { if (!(used & 1 << u)) { if (s == 0 && u - 1 >= 0 && xs[u - 1] == xs[u] && !(used & 1 << (u - 1))) continue; if (s == 1 && u + 1 < N && xs[u] == xs[u + 1] && !(used & 1 << (u + 1))) continue; dfs(s, pos + 1, used | 1 << u, (y * 10 + xs[u]) % K); } } } } dfs(0, 0, 0, 0); dfs(1, 0, 0, 0); foreach (q; 0 .. 1 << N) { foreach (ref y; yss[1][q]) { y *= ten; y %= K; y = K - y; y %= K; } } long ans; foreach (p; 0 .. 1 << N) { const q = ((1 << N) - 1) ^ p; yss[0][p].sort; yss[1][q].sort; const len = cast(int)(yss[0][p].length); int l, r; foreach (y; yss[1][q]) { for (; l < len && yss[0][p][l] < y; ++l) {} for (; r < len && yss[0][p][r] <= y; ++r) {} ans += (r - l); } } writeln(ans); } } catch (EOFException e) { } }