import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop;

void main() {
    auto s = readln.split;
    auto N = s[0].to!int;
    auto K = s[1].to!int;
    auto A = 0 ~ readln.split.map!(to!int).array;

    int[] B;
    foreach (i; 1..10) foreach (_; 0..A[i]) B ~= i;

    int[] base = new int[](N+1);
    base[0] = 1;
    foreach (i; 1..N+1) base[i] = base[i-1] * 10 % K;

    auto dp = new long[][](1<<N, K);
    dp[0][0] = 1;
    foreach (mask; 0..1<<N) {
        foreach (i; 0..N) foreach (j; 0..K) {
            if (mask & (1 << i)) continue;
            if (i > 0 && B[i] == B[i-1] && !(mask & (1 << (i-1)))) continue;
            int keta = mask.popcnt;
            int num = base[keta] * B[i] % K + j;
            num %= K;
            dp[(mask | (1 << i))][num] += dp[mask][j];
        }
    }

    dp[(1<<N)-1][0].writeln;
}

long[] solve(int N, int K, int[] A) {
    auto ans = new long[](K);

    do {
        int n = 0;
        int keta = 1;
        foreach (i; 0..N) {
            (n += (keta * A[i] % K)) %= K;
            keta = keta * 10 % K;
        }
        ans[n] += 1;
    } while (nextPermutation(A));

    return ans;
}